Switch to: References

Add citations

You must login to add citations.
  1. Finite axiomatizability using additional predicates.W. Craig & R. L. Vaught - 1958 - Journal of Symbolic Logic 23 (3):289-308.
    Download  
     
    Export citation  
     
    Bookmark   50 citations  
  • String theory.John Corcoran, William Frank & Michael Maloney - 1974 - Journal of Symbolic Logic 39 (4):625-637.
    For each positive n , two alternative axiomatizations of the theory of strings over n alphabetic characters are presented. One class of axiomatizations derives from Tarski's system of the Wahrheitsbegriff and uses the n characters and concatenation as primitives. The other class involves using n character-prefixing operators as primitives and derives from Hermes' Semiotik. All underlying logics are second order. It is shown that, for each n, the two theories are definitionally equivalent [or synonymous in the sense of deBouvere]. It (...)
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • On the weak Kleene scheme in Kripke's theory of truth.James Cain & Zlatan Damnjanovic - 1991 - Journal of Symbolic Logic 56 (4):1452-1468.
    It is well known that the following features hold of AR + T under the strong Kleene scheme, regardless of the way the language is Gödel numbered: 1. There exist sentences that are neither paradoxical nor grounded. 2. There are 2ℵ0 fixed points. 3. In the minimal fixed point the weakly definable sets (i.e., sets definable as {n∣ A(n) is true in the minimal fixed point where A(x) is a formula of AR + T) are precisely the Π1 1 sets. (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Generalized Revenge.Julien Murzi & Lorenzo Rossi - 2019 - Australasian Journal of Philosophy 98 (1):153-177.
    Since Saul Kripke’s influential work in the 1970s, the revisionary approach to semantic paradox—the idea that semantic paradoxes must be solved by weakening classical logic—has been increasingly popular. In this paper, we present a new revenge argument to the effect that the main revisionary approaches breed new paradoxes that they are unable to block.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • Stoic Sequent Logic and Proof Theory.Susanne Bobzien - 2019 - History and Philosophy of Logic 40 (3):234-265.
    This paper contends that Stoic logic (i.e. Stoic analysis) deserves more attention from contemporary logicians. It sets out how, compared with contemporary propositional calculi, Stoic analysis is closest to methods of backward proof search for Gentzen-inspired substructural sequent logics, as they have been developed in logic programming and structural proof theory, and produces its proof search calculus in tree form. It shows how multiple similarities to Gentzen sequent systems combine with intriguing dissimilarities that may enrich contemporary discussion. Much of Stoic (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A Unified Theory of Truth and Paradox.Lorenzo Rossi - 2019 - Review of Symbolic Logic 12 (2):209-254.
    The sentences employed in semantic paradoxes display a wide range of semantic behaviours. However, the main theories of truth currently available either fail to provide a theory of paradox altogether, or can only account for some paradoxical phenomena by resorting to multiple interpretations of the language. In this paper, I explore the wide range of semantic behaviours displayed by paradoxical sentences, and I develop a unified theory of truth and paradox, that is a theory of truth that also provides a (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Belnap-Dunn semantics for natural implicative expansions of Kleene's strong three-valued matrix with two designated values.Gemma Robles & José M. Méndez - 2019 - Journal of Applied Non-Classical Logics 29 (1):37-63.
    ABSTRACTA conditional is natural if it fulfils the three following conditions. It coincides with the classical conditional when restricted to the classical values T and F; it satisfies the Modus Ponens; and it is assigned a designated value whenever the value assigned to its antecedent is less than or equal to the value assigned to its consequent. The aim of this paper is to provide a ‘bivalent’ Belnap-Dunn semantics for all natural implicative expansions of Kleene's strong 3-valued matrix with two (...)
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • Semantical analysis of weak Kleene logics.Roberto Ciuni & Massimiliano Carrara - 2019 - Journal of Applied Non-Classical Logics 29 (1):1-36.
    This paper presents a semantical analysis of the Weak Kleene Logics Kw3 and PWK from the tradition of Bochvar and Halldén. These are three-valued logics in which a formula takes the third value if at least one of its components does. The paper establishes two main results: a characterisation result for the relation of logical con- sequence in PWK – that is, we individuate necessary and sufficient conditions for a set.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • La historia y la gramática de la recursión: una precisión desde la obra de Wittgenstein.Sergio Mota - 2014 - Pensamiento y Cultura 17 (1):20-48.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Obligations, Sophisms and Insolubles.Stephen Read - 2013 - National Research University “Higher School of Economics” - (Series WP6 “Humanities”).
    The focus of the paper is a sophism based on the proposition ‘This is Socrates’ found in a short treatise on obligational casus attributed to William Heytesbury. First, the background to the puzzle in Walter Burley’s traditional account of obligations (the responsio antiqua), and the objections and revisions made by Richard Kilvington and Roger Swyneshed, are presented. All six types of obligations described by Burley are outlined, including sit verum, the type used in the sophism. Kilvington and Swyneshed disliked the (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Independence Day?Matthew Mandelkern & Daniel Rothschild - 2019 - Journal of Semantics 36 (2):193-210.
    Two recent and influential papers, van Rooij 2007 and Lassiter 2012, propose solutions to the proviso problem that make central use of related notions of independence—qualitative in the first case, probabilistic in the second. We argue here that, if these solutions are to work, they must incorporate an implicit assumption about presupposition accommodation, namely that accommodation does not interfere with existing qualitative or probabilistic independencies. We show, however, that this assumption is implausible, as updating beliefs with conditional information does not (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A Three-Valued Fregean Quantification Logic.Minghui Ma & Yuanlei Lin - 2019 - Journal of Philosophical Logic 48 (2):409-423.
    Kripke’s Fregean quantification logic FQ fails to formalize the usual first-order logic with identity due to the interpretation of the conditional operator. Motivated by Kripke’s syntax and semantics, the three-valued Fregean quantification logic FQ3 is proposed. This three valued logic differs from Kleene and Łukasiewicz’s three-valued logics. The logic FQ3 is decidable. A sound and complete Hilbert-style axiomatic system for the logic FQ3 is presented.
    Download  
     
    Export citation  
     
    Bookmark  
  • Enciclopédia de Termos Lógico-Filosóficos.João Miguel Biscaia Branquinho, Desidério Murcho & Nelson Gonçalves Gomes (eds.) - 2006 - São Paulo, SP, Brasil: Martins Fontes.
    Esta enciclopédia abrange, de uma forma introdutória mas desejavelmente rigorosa, uma diversidade de conceitos, temas, problemas, argumentos e teorias localizados numa área relativamente recente de estudos, os quais tem sido habitual qualificar como «estudos lógico-filosóficos». De uma forma apropriadamente genérica, e apesar de o território teórico abrangido ser extenso e de contornos por vezes difusos, podemos dizer que na área se investiga um conjunto de questões fundamentais acerca da natureza da linguagem, da mente, da cognição e do raciocínio humanos, bem (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • „Kauza Afthonios“: Ilustrácia k otázke správneho riešenia antických paradoxov.Vladimir Marko - 2014 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 1 (20):88-103.
    The article deals with the question of correct reconstruction of and solutions to the ancient paradoxes. Analyzing one contemporary example of a reconstruction of the so-called Crocodile Paradox, taken from Sorensen’s A Brief History of Paradox, the author shows how the original pattern of paradox could have been incorrectly transformed in its meaning by overlooking its adequate historical background. Sorensen’s quoting of Aphthonius, as the author of a certain solution to the paradox, seems to be a systematic failure since the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The Truth Assignments That Differentiate Human Reasoning From Mechanistic Reasoning: The Evidence-Based Argument for Lucas' Goedelian Thesis.Bhupinder Singh Anand - 2016 - Cognitive Systems Research 40:35-45.
    We consider the argument that Tarski's classic definitions permit an intelligence---whether human or mechanistic---to admit finitary evidence-based definitions of the satisfaction and truth of the atomic formulas of the first-order Peano Arithmetic PA over the domain N of the natural numbers in two, hitherto unsuspected and essentially different, ways: (1) in terms of classical algorithmic verifiabilty; and (2) in terms of finitary algorithmic computability. We then show that the two definitions correspond to two distinctly different assignments of satisfaction and truth (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Proof Theory of Finite-valued Logics.Richard Zach - 1993 - Dissertation, Technische Universität Wien
    The proof theory of many-valued systems has not been investigated to an extent comparable to the work done on axiomatizatbility of many-valued logics. Proof theory requires appropriate formalisms, such as sequent calculus, natural deduction, and tableaux for classical (and intuitionistic) logic. One particular method for systematically obtaining calculi for all finite-valued logics was invented independently by several researchers, with slight variations in design and presentation. The main aim of this report is to develop the proof theory of finite-valued first order (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • Paul of Venice and Realist Developments of Roger Swyneshed's Treatment of Semantic Paradoxes.Miroslav Hanke - 2017 - History and Philosophy of Logic 38 (4):299-315.
    In the 1330s Roger Swyneshed formulated a solution to semantic paradoxes based on the distinction between correspondence with reality and self-falsification as truth-making factors. Since Swyneshed states that some valid inferences are not truth-preserving, his view implies the question of the general definition of validity which he does not address explicitly. Logical works attributed to Paul of Venice contain developments of Swyneshed's contextualist semantics substantially modified by the assumption that sentential meanings are objective propositional entities. The main goals of this (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Hybridized Paracomplete and Paraconsistent Logics.Colin Caret - 2017 - Australasian Journal of Logic 14 (1):281-325.
    This paper contributes to the study of paracompleteness and paraconsistency. We present two logics that address the following questions in novel ways. How can the paracomplete theorist characterize the formulas that defy excluded middle while maintaining that not all formulas are of this kind? How can the paraconsistent theorist characterize the formulas that obey explosion while still maintaining that there are some formulas not of this kind?
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Defining LFIs and LFUs in extensions of infectious logics.Szmuc Damian Enrique - 2016 - Journal of Applied Non-Classical Logics 26 (4):286-314.
    The aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the -fragment of the logics of nonsense, such as the ones due to Bochvar and Halldén, among others. Here, we extend these logics with classical negations, and we furthermore show that some of these extended systems can be properly regarded as logics of formal inconsistency and logics of formal undeterminedness.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • Some Non‐Recursive Classes of Thue Systems With Solvable Word Problem.Ann Yasuhara - 1974 - Mathematical Logic Quarterly 20 (8-12):121-132.
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrews
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017
    This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. David Elohim examines the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • (1 other version)The Independence of the Rule of Syllogism inS2.Ford Waghrees Gorgy - 1979 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 25 (31):481-484.
    Download  
     
    Export citation  
     
    Bookmark  
  • Supervaluationism and Its Logics.Achille C. Varzi - 2007 - Mind 116 (463):633-676.
    What sort of logic do we get if we adopt a supervaluational semantics for vagueness? As it turns out, the answer depends crucially on how the standard notion of validity as truth preservation is recasted. There are several ways of doing that within a supervaluational framework, the main alternative being between “global” construals (e.g., an argument is valid iff it preserves truth-under-all-precisifications) and “local” construals (an argument is valid iff, under all precisifications, it preserves truth). The former alternative is by (...)
    Download  
     
    Export citation  
     
    Bookmark   70 citations  
  • Computationalism, The Church–Turing Thesis, and the Church–Turing Fallacy.Gualtiero Piccinini - 2007 - Synthese 154 (1):97-120.
    The Church–Turing Thesis (CTT) is often employed in arguments for computationalism. I scrutinize the most prominent of such arguments in light of recent work on CTT and argue that they are unsound. Although CTT does nothing to support computationalism, it is not irrelevant to it. By eliminating misunderstandings about the relationship between CTT and computationalism, we deepen our appreciation of computationalism as an empirical hypothesis.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Neo-Logicism and Its Logic.Panu Raatikainen - 2020 - History and Philosophy of Logic 41 (1):82-95.
    The rather unrestrained use of second-order logic in the neo-logicist program is critically examined. It is argued in some detail that it brings with it genuine set-theoretical existence assumptions and that the mathematical power that Hume’s Principle seems to provide, in the derivation of Frege’s Theorem, comes largely from the ‘logic’ assumed rather than from Hume’s Principle. It is shown that Hume’s Principle is in reality not stronger than the very weak Robinson Arithmetic Q. Consequently, only a few rudimentary facts (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Brouwer versus Hilbert: 1907–1928.J. Posy Carl - 1998 - Science in Context 11 (2):291-325.
    The ArgumentL. E. J. Brouwer and David Hubert, two titans of twentieth-century mathematics, clashed dramatically in the 1920s. Though they were both Kantian constructivists, their notoriousGrundlagenstreitcentered on sharp differences about the foundations of mathematics: Brouwer was prepared to revise the content and methods of mathematics (his “Intuitionism” did just that radically), while Hilbert's Program was designed to preserve and constructively secure all of classical mathematics.Hilbert's interests and polemics at the time led to at least three misconstruals of intuitionism, misconstruals which (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The cognitive architecture for chaining of two mental operations.Jérôme Sackur & Stanislas Dehaene - 2009 - Cognition 111 (2):187-211.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • (1 other version)The Independence of Control Structures in Programmable Numberings of the Partial Recursive Functions.Gregory A. Riccardi - 1982 - Mathematical Logic Quarterly 28 (20‐21):285-296.
    Download  
     
    Export citation  
     
    Bookmark  
  • Uncertainty and the de Finetti tables.Jean Baratgin, David E. Over & Guy Politzer - 2013 - Thinking and Reasoning 19 (3-4):308-328.
    The new paradigm in the psychology of reasoning adopts a Bayesian, or prob- abilistic, model for studying human reasoning. Contrary to the traditional binary approach based on truth functional logic, with its binary values of truth and falsity, a third value that represents uncertainty can be introduced in the new paradigm. A variety of three-valued truth table systems are available in the formal literature, including one proposed by de Finetti. We examine the descriptive adequacy of these systems for natural language (...)
    Download  
     
    Export citation  
     
    Bookmark   48 citations  
  • A survey of Mučnik and Medvedev degrees.Peter G. Hinman - 2012 - Bulletin of Symbolic Logic 18 (2):161-229.
    We survey the theory of Mucnik and Medvedev degrees of subsets of $^{\omega}{\omega}$with particular attention to the degrees of $\Pi_{1}^{0}$ subsets of $^{\omega}2$. Sections 1-6 present the major definitions and results in a uniform notation. Sections 7-6 present proofs, some more complete than others, of the major results of the subject together with much of the required background material.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Composing models.Jan van Eijck & Yanjing Wang - 2011 - Journal of Applied Non-Classical Logics 21 (3-4):397-425.
    • We study a new composition operation on (epistemic) multiagent models and update actions that takes vocabulary extensions into account.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Towards applied theories based on computability logic.Giorgi Japaridze - 2010 - Journal of Symbolic Logic 75 (2):565-601.
    Computability logic (CL) is a recently launched program for redeveloping logic as a formal theory of computability, as opposed to the formal theory of truth that logic has more traditionally been. Formulas in it represent computational problems, "truth" means existence of an algorithmic solution, and proofs encode such solutions. Within the line of research devoted to finding axiomatizations for ever more expressive fragments of CL, the present paper introduces a new deductive system CL12 and proves its soundness and completeness with (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Complexity, Hypersets, and the Ecological Perspective on Perception-Action.Anthony Chemero & M. T. Turvey - 2007 - Biological Theory 2 (1):23-36.
    The ecological approach to perception-action is unlike the standard approach in several respects. It takes the animal-in-its-environment as the proper scale for the theory and analysis of perception-action, it eschews symbol based accounts of perception-action, it promotes self-organization as the theory-constitutive metaphor for perception-action, and it employs self-referring, non-predicative definitions in explaining perception-action. The present article details the complexity issues confronted by the ecological approach in terms suggested by Rosen and introduces non-well-founded set theory as a potentially useful tool for (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Formalizations après la lettre: Studies in Medieval Logic and Semantics.Catarina Dutilh Novaes - 2006 - Dissertation, Leiden University
    This thesis is on the history and philosophy of logic and semantics. Logic can be described as the ‘science of reasoning’, as it deals primarily with correct patterns of reasoning. However, logic as a discipline has undergone dramatic changes in the last two centuries: while for ancient and medieval philosophers it belonged essentially to the realm of language studies, it has currently become a sub-branch of mathematics. This thesis attempts to establish a dialogue between the modern and the medieval traditions (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Sophisticated knowledge representation and reasoning requires philosophy.Selmer Bringsjord, Micah Clark & Joshua Taylor - forthcoming - In Ruth Hagengruber (ed.), Philosophy's Relevance in Information Science.
    Knowledge Representation and Reasoning (KR&R) is based on the idea that propositional content can be rigorously represented in formal languages long the province of logic, in such a way that these representations can be productively reasoned over by humans and machines; and that this reasoning can be used to produce knowledge-based systems (KBSs). As such, KR&R is a discipline conventionally regarded to range across parts of artificial intelligence (AI), computer science, and especially logic. This standard view of KR&R’s participating fields (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • On understanding understanding.Roger Penrose - 1997 - International Studies in the Philosophy of Science 11 (1):7 – 20.
    It is argued, by use of specific examples, that mathematical understanding is something which cannot be modelled in terms of entirely computational procedures. Our conception of a natural number (a non-negative integer: 0, 1, 2, 3,…) is something which goes beyond any formulation in terms of computational rules. Our ability to perceive the properties of natural numbers depends upon our awareness, and represents just one of the many ways in which awareness provides an essential ingredient to our ability to understand. (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • (1 other version)Valuation Semantics for Intuitionic Propositional Calculus and some of its Subcalculi.Andréa Loparić - 2010 - Principia: An International Journal of Epistemology 14 (1):125-133.
    In this paper, we present valuation semantics for the Propositional Intuitionistic Calculus (also called Heyting Calculus) and three important subcalculi: the Implicative, the Positive and the Minimal Calculus (also known as Kolmogoroff or Johansson Calculus). Algorithms based in our definitions yields decision methods for these calculi.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Descriptions in Mathematical Logic.Gerard R. Renardel - 1984 - Studia Logica 43 (3):281-294.
    After a discussion of the different treatments in the literature of vacuous descriptions, the notion of descriptor is slightly generalized to function descriptor Ⅎ $\overset \rightarrow \to{y}$, so as to form partial functions φ = Ⅎ $y.A$ which satisfy $\forall \overset \rightarrow \to{x}z\leftrightarrow y=z))$. We use logic with existence predicate, as introduced by D. S. Scott, to handle partial functions, and prove that adding function descriptors to a theory based on such a logic is conservative. For theories with quantification over (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Schemata: The concept of schema in the history of logic.John Corcoran - 2006 - Bulletin of Symbolic Logic 12 (2):219-240.
    The syllogistic figures and moods can be taken to be argument schemata as can the rules of the Stoic propositional logic. Sentence schemata have been used in axiomatizations of logic only since the landmark 1927 von Neumann paper [31]. Modern philosophers know the role of schemata in explications of the semantic conception of truth through Tarski’s 1933 Convention T [42]. Mathematical logicians recognize the role of schemata in first-order number theory where Peano’s second-order Induction Axiom is approximated by Herbrand’s Induction-Axiom (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Intensionality and the gödel theorems.David D. Auerbach - 1985 - Philosophical Studies 48 (3):337--51.
    Philosophers of language have drawn on metamathematical results in varied ways. Extensionalist philosophers have been particularly impressed with two, not unrelated, facts: the existence, due to Frege/Tarski, of a certain sort of semantics, and the seeming absence of intensional contexts from mathematical discourse. The philosophical import of these facts is at best murky. Extensionalists will emphasize the success and clarity of the model theoretic semantics; others will emphasize the relative poverty of the mathematical idiom; still others will question the aptness (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • Computability and recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
    We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and "(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas. After a careful (...)
    Download  
     
    Export citation  
     
    Bookmark   52 citations  
  • Plural descriptions and many-valued functions.Alex Oliver & Timothy Smiley - 2005 - Mind 114 (456):1039-1068.
    Russell had two theories of definite descriptions: one for singular descriptions, another for plural descriptions. We chart its development, in which ‘On Denoting’ plays a part but not the part one might expect, before explaining why it eventually fails. We go on to consider many-valued functions, since they too bring in plural terms—terms such as ‘4’ or the descriptive ‘the inhabitants of London’ which, like plain plural descriptions, stand for more than one thing. Logicians need to take plural reference seriously (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • More about relatively lawless sequences.Joan Rand Moschovakis - 1994 - Journal of Symbolic Logic 59 (3):813-829.
    In the author's Relative lawlessness in intuitionistic analysis [this JOURNAL. vol. 52 (1987). pp. 68-88] and An intuitionistic theory of lawlike, choice and lawless sequences [Logic Colloquium '90. Springer-Verlag. Berlin. 1993. pp. 191-209] a notion of lawless ness relative to a countable information base was developed for classical and intuitionistic analysis. Here we simplify the predictability property characterizing relatively lawless sequences and derive it from the new axiom of closed data (classically equivalent to open data) together with a natural principle (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Proof theory in the USSR 1925–1969.Grigori Mints - 1991 - Journal of Symbolic Logic 56 (2):385-424.
    We present a survey of proof theory in the USSR beginning with the paper by Kolmogorov [1925] and ending (mostly) in 1969; the last two sections deal with work done by A. A. Markov and N. A. Shanin in the early seventies, providing a kind of effective interpretation of negative arithmetic formulas. The material is arranged in chronological order and subdivided according to topics of investigation. The exposition is more detailed when the work is little known in the West or (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)Strong termination for the epsilon substitution method.Grigori Mints - 1996 - Journal of Symbolic Logic 61 (4):1193-1205.
    Ackermann proved termination for a special order of reductions in Hilbert's epsilon substitution method for the first order arithmetic. We establish termination for arbitrary order of reductions.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The optimality of induction as an axiomatization of arithmetic.Daniel Leivant - 1983 - Journal of Symbolic Logic 48 (1):182-184.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • (1 other version)A completeness theorem in modal logic.Saul Kripke - 1959 - Journal of Symbolic Logic 24 (1):1-14.
    Download  
     
    Export citation  
     
    Bookmark   275 citations  
  • (1 other version)The work of Kurt gödel.Stephen C. Kleene - 1976 - Journal of Symbolic Logic 41 (4):761-778.
    Download  
     
    Export citation  
     
    Bookmark   3 citations