Logic and Foundations Commons^™

Soundness And Completeness Results For The Logic Of Evidence Aggregation And Its Probability Semantics, Eoin Moore

Dissertations, Theses, and Capstone Projects

The Logic of Evidence Aggregation (LEA), introduced in 2020, offers a solution to the problem of evidence aggregation, but LEA is not complete with respect to the intended probability semantics. This left open the tasks to find sound and complete semantics for LEA and a proper axiomatization for probability semantics. In this thesis we do both. We also develop the proof theory for some LEA-related logics and show surprising connections between LEA-related logics and Lax Logic.

What Is A Number?, Nicholas Radley

HON499 projects

This essay is, in essence, an attempt to make a case for mathematical platonism. That is to say, that we argue for the existence of mathematical objects independent of our perception of them. The essay includes a somewhat informal construction of number systems ranging from the natural numbers to the complex numbers.

Reverse Mathematics Of Ramsey's Theorem, Nikolay Maslov

Electronic Theses, Projects, and Dissertations

Reverse mathematics aims to determine which set theoretic axioms are necessary to prove the theorems outside of the set theory. Since the 1970’s, there has been an interest in applying reverse mathematics to study combinatorial principles like Ramsey’s theorem to analyze its strength and relation to other theorems. Ramsey’s theorem for pairs states that for any infinite complete graph with a finite coloring on edges, there is an infinite subset of nodes all of whose edges share one color. In this thesis, we introduce the fundamental terminology and techniques for reverse mathematics, and demonstrate their use in proving Kőnig's lemma …

Generations Of Reason: A Family’S Search For Meaning In Post-Newtonian England (Book Review), Calvin Jongsma

Faculty Work Comprehensive List

Reviewed Title: Generations of Reason: A Family's Search for Meaning in Post-Newtonian England by Joan L. Richards. New Haven, CT: Yale University Press, 2021. 456 pp. ISBN: 9780300255492.

Richard Whately's Revitalization Of Syllogistic Logic, Calvin Jongsma

Faculty Work Comprehensive List

This is an expanded version of the first chapter Richard Whately’s Revitalization of Syllogistic Logic in Aristotle’s Syllogism and the Creation of Modern Logic edited by Lukas M. Verburgt and Matteo Cosci (Bloomsbury, 2023). Drawing upon the author’s 1982 Ph. D. dissertation (https://digitalcollections.dordt.edu/faculty_work/230/ ) and more current scholarship, this essay traces the critical historical background to Whately’s work in more detail than could be done in the published version.

Symbolic Logic, Tony Roy

Books

Textbook for symbolic logic, beginning at a level appropriate for beginning students, continuing through Godel's completeness and incompleteness theorems. The text naturally divides into two volumes, the first for reasoning in logic, the second for reasoning about it.

The first volume includes parts I and II of the text. Part I introduces the complete classical predicate calculus with equality, including both axiomatic and natural derivation systems. Part II transitions to methods for reasoning about logic, including direct reasoning from definitions and mathematical induction.

The second volume includes parts III and IV of the text. Part III develops basic results in …

How To Guard An Art Gallery: A Simple Mathematical Problem, Natalie Petruzelli

The Review: A Journal of Undergraduate Student Research

The art gallery problem is a geometry question that seeks to find the minimum number of guards necessary to guard an art gallery based on the qualities of the museum’s shape, specifically the number of walls. Solved by Václav Chvátal in 1975, the resulting Art Gallery Theorem dictates that ⌊n/3⌋ guards are always sufficient and sometimes necessary to guard an art gallery with n walls. This theorem, along with the argument that proves it, are accessible and interesting results even to one with little to no mathematical knowledge, introducing readers to common concepts in both geometry and graph …

Inductive Constructions In Logic And Graph Theory, Davis Deaton

Honors Scholars Collaborative Projects

Just as much as mathematics is about results, mathematics is about methods. This thesis focuses on one method: induction. Induction, in short, allows building complex mathemati- cal objects from simple ones. These mathematical objects include the foundational, like logical statements, and the abstract, like cell complexes. Non-mathematicians struggle to find a common thread throughout all of mathematics, but I present induction as such a common thread here. In particular, this thesis discusses everything from the very foundations of mathematics all the way to combina- torial manifolds. I intend to be casual and opinionated while still providing all necessary formal rigor. …

Formally Verifying Peano Arithmetic, Morgan Sinclaire

Boise State University Theses and Dissertations

This work is concerned with implementing Gentzen’s consistency proof in the Coq theorem prover.

In Chapter 1, we summarize the basic philosophical, historical, and mathematical background behind this theorem. This includes the philosophical motivation for attempting to prove the consistency of Peano arithmetic, which traces itself from the first attempted axiomatizations of mathematics to the maturation of Hilbert’s program. We introduce many of the basic concepts in mathematical logic along the way: first-order logic (FOL), Peano arithmetic (PA), primitive recursive arithmetic (PRA), Gödel's 2nd Incompleteness theorem, and the ordinals below ε₀.

In …

Choice Of Choice: Paradoxical Results Surrounding Of The Axiom Of Choice, Connor Hurley

Honors Theses

When people think of mathematics they think "right or wrong," "empirically correct" or "empirically incorrect." Formalized logically valid arguments are one important step to achieving this definitive answer; however, what about the underlying assumptions to the argument? In the early 20th century, mathematicians set out to formalize these assumptions, which in mathematics are known as axioms. The most common of these axiomatic systems was the Zermelo-Fraenkel axioms. The standard axioms in this system were accepted by mathematicians as obvious, and deemed by some to be sufficiently powerful to prove all the intuitive theorems already known to mathematicians. However, this system …

Does Logic Help Us Beat Monty Hall?, Adam J. Hammett, Nathan A. Harold, Tucker R. Rhodes

The Research and Scholarship Symposium (2013-2019)

The classical Monty Hall problem entails that a hypothetical game show contestant be presented three doors and told that behind one door is a car and behind the other two are far less appealing prizes, like goats. The contestant then picks a door, and the host (Monty) is to open a different door which contains one of the bad prizes. At this point in the game, the contestant is given the option of keeping the door she chose or changing her selection to the remaining door (since one has already been opened by Monty), after which Monty opens the chosen …

Constructing A Categorical Framework Of Metamathematical Comparison Between Deductive Systems Of Logic, Alex Gabriel Goodlad

Senior Projects Spring 2016

The topic of this paper in a broad phrase is “proof theory". It tries to theorize the general

notion of “proving" something using rigorous definitions, inspired by previous less general

theories. The purpose for being this general is to eventually establish a rigorous framework

that can bridge the gap when interrelating different logical systems, particularly ones

that have not been as well defined rigorously, such as sequent calculus. Even as far as

semantics go on more formally defined logic such as classic propositional logic, concepts

like “completeness" and “soundness" between the “semantic" and the “deductive system"

is too arbitrarily defined …

Transition To Higher Mathematics: Structure And Proof (Second Edition), Bob A. Dumas, John E. Mccarthy

Books and Monographs

This book is written for students who have taken calculus and want to learn what “real mathematics" is. We hope you will find the material engaging and interesting, and that you will be encouraged to learn more advanced mathematics. This is the second edition of our text. It is intended for students who have taken a calculus course, and are interested in learning what higher mathematics is all about. It can be used as a textbook for an "Introduction to Proofs" course, or for self-study. Chapter 1: Preliminaries, Chapter 2: Relations, Chapter 3: Proofs, Chapter 4: Principles of Induction, Chapter …

Some Observations On Scientific Epistemology With Applications To Conflict Resolution And Constructive Controversy, Judith Puncochar, Don Faust

Other Presentations

An overview, by Judy and Don (published in 2013 in the BULLETIN OF SYMBOLIC LOGIC):

Explorationism is a perspective wherein all of our knowledge is (so far) less than certain, and naturally would come equipped with a base logic entailing machinery for representing and processing evidential knowledge. One such base logic is Evidence Logic, which strives to deal with the phenomenon of the gradational presence of both confirmatory and refutatory evidence. From this perspective, we will address questions surrounding sociological problem areas that we see as deeply infused with substantial epistemological factors. By defining a framework as any theory, …

A Quasi-Classical Logic For Classical Mathematics, Henry Nikogosyan

Honors College Theses

Classical mathematics is a form of mathematics that has a large range of application; however, its application has boundaries. In this paper, I show that Sperber and Wilson’s concept of relevance can demarcate classical mathematics’ range of applicability by demarcating classical logic’s range of applicability. Furthermore, I introduce how to systematize Sperber and Wilson’s concept of relevance into a quasi-classical logic that can explain classical logic’s and classical mathematics’ range of applicability.

Games And Logic, Gabriel Sandu

Baltic International Yearbook of Cognition, Logic and Communication

The idea behind these games is to obtain an alternative characterization of logical notions cherished by logicians such as truth in a model, or provability (in a formal system). We offer a quick survey of Hintikka's evaluation games, which offer an alternative notion of truth in a model for first-order langauges. These are win-lose, extensive games of perfect information. We then consider a variation of these games, IF games, which are win-lose extensive games of imperfect information. Both games presuppose that the meaning of the basic vocabulary of the language is given. To give an account of the linguistic conventions …

Ludics, Dialogue And Inferentialism, Alain Lecomte

Baltic International Yearbook of Cognition, Logic and Communication

In this paper, we try to show that Ludics, a (pre-)logical framework invented by J-Y. Girard, enables us to rethink some of the relationships between Philosophy, Semantics and Pragmatics. In particular, Ludics helps to shed light on the nature of dialogue and to articulate features of Brandom's inferentialism.

Trust And Risk In Games Of Partial Information, Robin Clark

Baltic International Yearbook of Cognition, Logic and Communication

Games of partial information have been used to explicate Gricean implicature; their solution concept has been murky, however. In this paper, I will develop a simple solution concept that can be used to solve games of partial information, depending on the players' mutual trust and tolerance for risk. In addition, I will develop an approach to non-conventional quantity implicatures that relies on "face" (Goffman (1967), Brown and Levinson (1987)).

On The Logic Of Reverse Mathematics, Alaeddine Saadaoui

Theses, Dissertations and Capstones

The goal of reverse mathematics is to study the implication and non-implication relationships between theorems. These relationships have their own internal logic, allowing some implications and non-implications to be derived directly from others. The goal of this thesis is to characterize this logic in order to capture the relationships between specific mathematical works. The results of our study are a finite set of rules for this logic and the corresponding soundness and completeness theorems. We also compare our logic with modal logic and strict implication logic. In addition, we explain two applications of S-logic in topology and second order arithmetic.

A Foundation For Arithmetic, Kevin Halasz

Summer Research

This paper contains a proof of Frege's Theorem: the statement, first discovered by George Boolos, that Gottlob Frege's failed proof of the analyticity of arithmetic could be slightly altered so as to provide an axiomitization of arithmetic with just one proposition. After an expository treatment of the mathematical work in Frege's 'Foundations of Arithmetic,' the work in which Frege presented his failed proof, a novel, and particularly succinct, proof of the Theorem is provided.

The Mathematical Landscape, Antonio Collazo

CMC Senior Theses

The intent of this paper is to present the reader will enough information to spark a curiosity in to the subject. By no means is the following a complete formulation of any of the topics covered. I want to give the reader a tour of the mathematical landscape. There are plenty of further details to explore in each section, I have just touched the tip the iceberg. The work is basically in four sections: Numbers, Geometry, Functions, Sets and Logic, which are the basic building blocks of Math. The first sections are a exposition into the mathematical objects and their …

A Philosophical Examination Of Proofs In Mathematics, Eric Almeida

Undergraduate Review

No abstract provided.

A Unifying Field In Logics: Neutrosophic Logic Neutrosophy, Neutrosophic Set, Neutrosophic Probability (In Traditional Chinese), Florentin Smarandache, Feng Liu

Branch Mathematics and Statistics Faculty and Staff Publications

No abstract provided.

Proof In Law And Science, David H. Kaye

Journal Articles

This article addresses proof in both science and law. Both disciplines utilize proof of facts and proof of theories, but for different purposes and, consequently, in different ways. Some similarities exist, however, in how both disciplines use a series of premises followed by a conclusion to form an argument, and thus constitute a logic. This article analyzes the ways in which legal logic and scientific logic differ. Finding facts in law involves the same logic but quite different procedures than scientific fact-finding. Finding, or rather constructing, the law is also very different from scientific theorizing. But such differences do not …