Theodore Hailperin. Remarks on identity and description in first-order axiom systems. The journal of symbolic logic, vol. 19 (1954), pp. 14–20.

1955 ◽  
Vol 20 (1) ◽  
pp. 81-83
Author(s):  
William Craig
1998 ◽  
pp. 132-139
Author(s):  
Melvin Fitting ◽  
Richard L. Mendelsohn
Keyword(s):  

2008 ◽  
Vol 1 (3) ◽  
pp. 393-393

Steve Awodey and Kohei Kishida (2008). Topology and Modality: The Topological Interpretation of First-Order Modal Logic. The Review of Symbolic Logic 1(2): 146-166.On page 148 of this article an error was introduced during the production process. The final equation in the displayed formula 8 lines from the bottom of the page should read,[0, 1) ≠ [0, 1]The publisher regrets this error.


10.29007/t28j ◽  
2018 ◽  
Author(s):  
Loris D'Antoni ◽  
Margus Veanes

We extend weak monadic second-order logic of one successor (WS1S) to symbolic alphabets byallowing character predicates to range over decidable first order theories and not just finite alphabets.We call this extension symbolic WS1S (s-WS1S). We then propose two decision procedures for such alogic: 1) we use symbolic automata to extend the classic reduction from WS1S to finite automata toour symbolic logic setting; 2) we show that every s-WS1S formula can be reduced to a WS1S formulathat preserves satisfiability, at the price of an exponential blow-up.


Author(s):  
Gregory H. Moore

The creation of modern logic is one of the most stunning achievements of mathematics and philosophy in the twentieth century. Modern logic – sometimes called logistic, symbolic logic or mathematical logic – makes essential use of artificial symbolic languages. Since Aristotle, logic has been a part of philosophy. Around 1850 the mathematician Boole began the modern development of symbolic logic. During the twentieth century, logic continued in philosophy departments, but it began to be seriously investigated and taught in mathematics departments as well. The most important examples of the latter were, from 1905 on, Hilbert at Göttingen and then, during the 1920s, Church at Princeton. As the twentieth century began, there were several distinct logical traditions. Besides Aristotelian logic, there was an active tradition in algebraic logic initiated by Boole in the UK and continued by C.S. Peirce in the USA and Schröder in Germany. In Italy, Peano began in the Boolean tradition, but soon aimed higher: to express all major mathematical theorems in his symbolic logic. Finally, from 1879 to 1903, Frege consciously deviated from the Boolean tradition by creating a logic strong enough to construct the natural and real numbers. The Boole–Schröder tradition culminated in the work of Löwenheim (1915) and Skolem (1920) on the existence of a countable model for any first-order axiom system having a model. Meanwhile, in 1900, Russell was strongly influenced by Peano’s logical symbolism. Russell used this as the basis for his own logic of relations, which led to his logicism: pure mathematics is a part of logic. But his discovery of Russell’s paradox in 1901 required him to build a new basis for logic. This culminated in his masterwork, Principia Mathematica, written with Whitehead, which offered the theory of types as a solution. Hilbert came to logic from geometry, where models were used to prove consistency and independence results. He brought a strong concern with the axiomatic method and a rejection of the metaphysical goal of determining what numbers ‘really’ are. In his view, any objects that satisfied the axioms for numbers were numbers. He rejected the genetic method, favoured by Frege and Russell, which emphasized constructing numbers rather than giving axioms for them. In his 1917 lectures Hilbert was the first to introduce first-order logic as an explicit subsystem of all of logic (which, for him, was the theory of types) without the infinitely long formulas found in Löwenheim. In 1923 Skolem, directly influenced by Löwenheim, also abandoned those formulas, and argued that first-order logic is all of logic. Influenced by Hilbert and Ackermann (1928), Gödel proved the completeness theorem for first-order logic (1929) as well as incompleteness theorems for arithmetic in first-order and higher-order logics (1931). These results were the true beginning of modern logic.


1975 ◽  
Vol 40 (1) ◽  
pp. 35-40 ◽  
Author(s):  
R. I. Goldblatt

In the early days of the development of Kripke-style semantics for modal logic a great deal of effort was devoted to showing that particular axiom systems were characterised by a class of models describable by a first-order condition on a binary relation. For a time the approach seemed all encompassing, but recent work by Thomason [6] and Fine [2] has shown it to be somewhat limited—there are logics not determined by any class of Kripke models at all. In fact it now seems that modal logic is basically second-order in nature, in that any system may be analysed in terms of structures having a nominated class of second-order individuals (subsets) that serve as interpretations of propositional variables (cf. [7]). The question has thus arisen as to how much of modal logic can be handled in a first-order way, and precisely which modal sentences are determined by first-order conditions on their models. In this paper we present a model-theoretic characterisation of this class of sentences, and show that it does not include the much discussed LMp → MLp.Definition 1. A modal frame ℱ = 〈W, R〉 consists of a set W on which a binary relation R is defined. A valuation V on ℱ is a function that associates with each propositional variable p a subset V(p) of W (the set of points at which p is “true”).


1946 ◽  
Vol 11 (3) ◽  
pp. 65-70 ◽  
Author(s):  
Archie Blake

A fundamental problem of symbolic logic is to define logical calculi sufficient to comprise important parts of mathematics, and to develop systematic methods of calculation therein.The possibility of progress in this direction has been severely limited by Gödel's proof that a consistent system sufficient to comprise arithmetic must contain propositions whose truth-value cannot be decided within the system, and by Church's extension of Gödel's method to the result that even in the first order logical function calculus the general decision problem cannot be solved.


2008 ◽  
Vol 13 (1) ◽  
pp. 116-140
Author(s):  
Kurt Mosser

In theCritique of Pure Reason, Kant conceives of general logic as a set of universal and necessary rules for the possibility of thought, or as a set of minimal necessary conditions for ascribing rationality to an agent (exemplified by the principle of non-contradiction). Such a conception, of course, contrasts with contemporary notions of formal, mathematical or symbolic logic. Yet, in so far as Kant seeks to identify those conditions that must hold for the possibility of thought in general, such conditions must holda fortiorifor any specific model of thought, including axiomatic treatments of logic and standard natural deduction models of first-order predicate logic. Kant's general logic seeks to isolate those conditions by thinking through – or better, reflecting on – those conditions that themselves make thought possible.


Sign in / Sign up

Export Citation Format

Share Document