On the Syntax of Logic and Set Theory

We introduce an extension of the propositional calculus to include abstracts of predicates and quantifiers, employing a single rule along with a novel comprehension schema and a principle of extensionality, which are substituted for the Bernays postulates for quantifiers and the comprehension schemata of ZF and other set theories. We prove that it is consistent in any finite Boolean subset lattice. We investigate the antinomies of Russell, Cantor, Burali-Forti, and others, and discuss the relationship of the system to other set theoretic systems ZF, NBG, and NF. We discuss two methods of axiomatizing higher order quantification and abstraction, and then very briefly discuss the application of one of these methods to areas of mathematics outside of logic.Comment: 34 pages, accepted, to appear in the Review of Symbolic Logi

The Logic of Opacity

We explore the view that Frege's puzzle is a source of straightforward counterexamples to Leibniz's law. Taking this seriously requires us to revise the classical logic of quantifiers and identity; we work out the options, in the context of higher-order logic. The logics we arrive at provide the resources for a straightforward semantics of attitude reports that is consistent with the Millian thesis that the meaning of a name is just the thing it stands for. We provide models to show that some of these logics are non-degenerate

Polynomial-time algorithms for generation of prime implicants

AbstractA notion of a neighborhood cube of a term of a Boolean function represented in the canonical disjunctive normal form is introduced. A relation between neighborhood cubes and prime implicants of a Boolean function is established. Various aspects of the problem of prime implicants generation are identified and neighborhood cube-based algorithms for their solution are developed. The correctness of algorithms is proven and their time complexity is analyzed. It is shown that all presented algorithms are polynomial in the number of minterms occurring in the canonical disjunctive normal form representation of a Boolean function. A summary of the known approaches to the solution of the problem of the generation of prime implicants is also included

Mathematics and language

This essay considers the special character of mathematical reasoning, and draws on observations from interactive theorem proving and the history of mathematics to clarify the nature of formal and informal mathematical language. It proposes that we view mathematics as a system of conventions and norms that is designed to help us make sense of the world and reason efficiently. Like any designed system, it can perform well or poorly, and the philosophy of mathematics has a role to play in helping us understand the general principles by which it serves its purposes well

Boundary Algebra: A Simpler Approach to Boolean Algebra and the Sentential Connectives

Boundary algebra [BA] is a algebra of type , and a simplified notation for Spencer-Brown’s (1969) primary algebra. The syntax of the primary arithmetic [PA] consists of two atoms, () and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting, indifferently, the presence or absence of () into a PA formula yields a BA formula. The BA axioms are A1: ()()= (), and A2: “(()) [abbreviated ‘⊥’] may be written or erased at will,” implying (⊥)=(). The repeated application of A1 and A2 simplifies any PA formula to either () or ⊥. The basis for BA is B1: abc=bca (concatenation commutes & associates); B2, ⊥a=a (BA has a lower bound, ⊥); B3, (a)a=() (BA is a complemented lattice); and B4, (ba)a=(b)a (implies that BA is a distributive lattice). BA has two intended models: (1) the Boolean algebra 2 with base set B={(),⊥}, such that () ⇔ 1 [dually 0], (a) ⇔ a′, and ab ⇔ a∪b [a∩b]; and (2) sentential logic, such that () ⇔ true [false], (a) ⇔ ~a, and ab ⇔ a∨b [a∧b]. BA is a self-dual notation, facilitates a calculational style of proof, and simplifies clausal reasoning and Quine’s truth value analysis. BA resembles C.S. Peirce’s graphical logic, the symbolic logics of Leibniz and W.E. Johnson, the 2 notation of Byrne (1946), and the Boolean term schemata of Quine (1982).Boundary algebra; boundary logic; primary algebra; primary arithmetic; Boolean algebra; calculation proof; G. Spencer-Brown; C.S. Peirce; existential graphs

Boundary Algebra: A Simple Notation for Boolean Algebra and the Truth Functors

Boundary algebra [BA] is a simpler notation for Spencer-Brown’s (1969) primary algebra [pa], the Boolean algebra 2, and the truth functors. The primary arithmetic [PA] consists of the atoms ‘()’ and the blank page, concatenation, and enclosure between ‘(‘ and ‘)’, denoting the primitive notion of distinction. Inserting letters denoting the presence or absence of () into a PA formula yields a BA formula. The BA axioms are "()()=()" (A1), and "(()) [=?] may be written or erased at will” (A2). Repeated application of these axioms to a PA formula yields a member of B= {(),?} called its simplification. (a) has two intended interpretations: (a) ? a? (Boolean algebra 2), and (a) ? ~a (sentential logic). BA is self-dual: () ? 1 [dually 0] so that B is the carrier for 2, ab ? a?b [a?b], and (a)b [(a(b))] ? a=b, so that ?=() [()=?] follows trivially and B is a poset. The BA basis abc= bca (Dilworth 1938), a(ab)= a(b), and a()=() (Bricken 2002) facilitates clausal reasoning and proof by calculation. BA also simplifies normal forms and Quine’s (1982) truth value analysis. () ? true [false] yields boundary logic.G. Spencer Brown; boundary algebra; boundary logic; primary algebra; primary arithmetic; Boolean algebra; calculation proof; C.S. Peirce; existential graphs.

Modes of Truth

The aim of this volume is to open up new perspectives and to raise new research questions about a unified approach to truth, modalities, and propositional attitudes. The volume’s essays are grouped thematically around different research questions. The first theme concerns the tension between the theoretical role of the truth predicate in semantics and its expressive function in language. The second theme of the volume concerns the interaction of truth with modal and doxastic notions. The third theme covers higher-order solutions to the semantic and modal paradoxes, providing an alternative to first-order solutions embraced in the first two themes. This book will be of interest to researchers working in epistemology, logic, philosophy of logic, philosophy of language, philosophy of mathematics, and semantics

Facets and Levels of Mathematical Abstraction

International audienceMathematical abstraction is the process of considering and manipulating operations, rules, methods and concepts divested from their reference to real world phenomena and circumstances, and also deprived from the content connected to particular applications. There is no one single way of performing mathematical abstraction. The term "abstraction" does not name a unique procedure but a general process, which goes many ways that are mostly simultaneous and intertwined ; in particular, the process does not amount only to logical subsumption. I will consider comparatively how philosophers consider abstraction and how mathematicians perform it, with the aim to bring to light the fundamental thinking processes at play, and to illustrate by significant examples how much intricate and multi-leveled may be the combination of typical mathematical techniques which include axiomatic method, invarianceprinciples, equivalence relations and functional correspondences.L'abstraction mathématique consiste en la considération et la manipulation d'opérations, règles et concepts indépendamment du contenu dont les nantissent des applications particulières et du rapport qu'ils peuvent avoir avec les phénomènes et les circonstances du monde réel. L'abstraction mathématique emprunte diverses voies. Le terme " abstraction " ne désigne pasune procédure unique, mais un processus général où s'entrecroisent divers procédés employés successivement ou simultanément. En particulier, l'abstraction mathématique ne se réduit pas à la subsomption logique. Je vais étudier comparativement en quels termes les philosophes expliquent l'abstraction et par quels moyens les mathématiciens la mettent en oeuvre. Je voudrais parlà mettre en lumière les principaux processus de pensée en jeu et illustrer par des exemples divers niveaux d'intrication de techniques mathématiques récurrentes, qui incluent notamment la méthode axiomatique, les principes d'invariance, les relations d'équivalence et les correspondances fonctionnelles

What is truth?

I defend the correspondence theory of truth, according to which a statement’s truth consists in a relation of correspondence with extralinguistic fact. There are well-known objections to this view, which I consider and rebut, and also important rival accounts, principal among which are so-called deflationist theories and epistemic theories. Epistemic theories relate the concept of truth to our state of knowledge, but fail, I argue, to respect the crucial distinction between a criterion of truth and the meaning of truth: the view that one cannot do semantics, or metaphysics, without addressing epistemic issues is rejected by this work. Against epistemic theories, I illustrate how truth is independent of epistemic considerations. Deflationism is the more popular of the rival accounts and has gained considerable momentum over the past two decades. It is therefore dealt with in greater detail by this work. Deflationist theories exploit the paradigmatic ‘“Snow is white” is true iff snow is white’ biconditional to argue for an insubstantialist account, according to which truth is conservative with respect to non-semantical facts. On this view, truth’s raison d’être is merely to perform the useful expressive function of generalising over possibly infinite sets of assertions. Against deflationist theories, I claim that the work done by Jeffrey Ketland and Stewart Shapiro conclusively demonstrates how truth is informationally additive over non-semantic facts, while deflationism itself is also an excessively impoverishing theory, inadequate to the tasks it purports to accomplish. This work also defends the thesis that Alfred Tarski’s well-known theory of truth is an authentic correspondence theory. To say this is to say that the clauses of a Tarskian truth-definition can be interpreted in terms of a relation of correspondence that holds between true sentences and the states of affairs they describe. I provide a precise account of what the correspondence in question consists in, claiming that true sentences are homomorphic images of facts, i.e. a true sentence represents, in a form-preserving manner, the truth-making facts in it. This gives precise expression to Wittgenstein’s thesis that true sentences picture the world