Switch to: References

Add citations

You must login to add citations.
  1. (1 other version)The Logic of Calculation.John T. Kearns - 1977 - Mathematical Logic Quarterly 23 (1-6):45-58.
    Download  
     
    Export citation  
     
    Bookmark  
  • A Modest Logic of Plurals.Alex Oliver & Timothy Smiley - 2006 - Journal of Philosophical Logic 35 (3):317-348.
    We present a plural logic that is as expressively strong as it can be without sacrificing axiomatisability, axiomatise it, and use it to chart the expressive limits set by axiomatisability. To the standard apparatus of quantification using singular variables our object-language adds plural variables, a predicate expressing inclusion (is/are/is one of/are among), and a plural definite description operator. Axiomatisability demands that plural variables only occur free, but they have a surprisingly important role. Plural description is not eliminable in favour of (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  • Did Frege believe Frege's principle?Francis Jeffry Pelletier - 2001 - Journal of Logic, Language and Information 10 (1):87-114.
    In this essay I will consider two theses that are associated with Frege,and will investigate the extent to which Frege really believed them.Much of what I have to say will come as no surprise to scholars of thehistorical Frege. But Frege is not only a historical figure; he alsooccupies a site on the philosophical landscape that has allowed hisdoctrines to seep into the subconscious water table. And scholars in a widevariety of different scholarly establishments then sip from thesedoctrines. I believe (...)
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • Constructive assertions in an extension of classical mathematics.Vladimir Lifschitz - 1982 - Journal of Symbolic Logic 47 (2):359-387.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • The decision problem for formulas with a small number of atomic subformulas.Harry R. Lewis & Warren D. Goldfarb - 1973 - Journal of Symbolic Logic 38 (3):471-480.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Semantics without Toil? Brady and Rush Meet Halldén.Lloyd Humberstone - 2019 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 26 (3):340–404.
    The present discussion takes up an issue raised in Section 5 of Ross Brady and Penelope Rush’s paper ‘Four Basic Logical Issues’ concerning the (claimed) triviality – in the sense of automatic availability – of soundness and completeness results for a logic in a metalanguage employing at least as much logical vocabulary as the object logic, where the metalogical behaviour of the common logical vocabulary is as in the object logic. We shall see – in Propositions 4.5–4.7 – that this (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The Decision Problem for Effective Procedures.Nathan Salmón - 2023 - Logica Universalis 17 (2):161-174.
    The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined even if it is not sufficiently formal and precise to belong to mathematics proper (in a narrow sense)—and even if (as many have asserted) for that reason the Church–Turing thesis is unprovable. It is proved logically that the class of effective procedures is not decidable, i.e., that no effective procedure is possible for ascertaining whether a given procedure is effective. This (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Effective Procedures.Nathan Salmon - 2023 - Philosophies 8 (2):27.
    This is a non-technical version of "The Decision Problem for Effective Procedures." The “somewhat vague, intuitive” notion from computability theory of an effective procedure (method) or algorithm can be fairly precisely defined, even if it does not have a purely mathematical definition—and even if (as many have asserted) for that reason, the Church–Turing thesis (that the effectively calculable functions on natural numbers are exactly the general recursive functions), cannot be proved. However, it is logically provable from the notion of an (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • A Pragmatic-Semiotic Defence of Bivalence.Marc Champagne - 2021 - History and Philosophy of Logic 43 (2):143-157.
    Since Peirce defined the first operators for three-valued logic, it is usually assumed that he rejected the principle of bivalence. However, I argue that, because bivalence is a principle, the strategy used by Peirce to defend logical principles can be used to defend bivalence. Construing logic as the study of substitutions of equivalent representations, Peirce showed that some patterns of substitution get realized in the very act of questioning them. While I recognize that we can devise non-classical notations, I argue (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The A-Theory of Time, The B-Theory of Time, and ‘Taking Tense Seriously’.Dean W. Zimmerman - 2005 - Dialectica 59 (4):401-457.
    The paper has two parts: First, I describe a relatively popular thesis in the philosophy of propositional attitudes, worthy of the name ‘taking tense seriously’; and I distinguish it from a family of views in the metaphysics of time, namely, the A-theories (or what are sometimes called ‘tensed theories of time’). Once the distinction is in focus, a skeptical worry arises. Some A-theorists maintain that the difference between past, present, and future, is to be drawn in terms of what exists: (...)
    Download  
     
    Export citation  
     
    Bookmark   78 citations  
  • Necessarily Maybe. Quantifiers, Modality and Vagueness.Alessandro Torza - 2015 - In Quantifiers, Quantifiers, and Quantifiers. Themes in Logic, Metaphysics, and Language. (Synthese Library vol. 373). Springer. pp. 367-387.
    Languages involving modalities and languages involving vagueness have each been thoroughly studied. On the other hand, virtually nothing has been said about the interaction of modality and vagueness. This paper aims to start filling that gap. Section 1 is a discussion of various possible sources of vague modality. Section 2 puts forward a model theory for a quantified language with operators for modality and vagueness. The model theory is followed by a discussion of the resulting logic. In Section 3, the (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)Four simple systems of modal propositional logic.Gerald J. Massey - 1965 - Philosophy of Science 32 (3/4):342-355.
    Four progressively ambitious systems of modal propositional logic are set forth, together with decision procedures. The simultaneous employment of parenthesis notation and parenthesis-free notation, the dual use of symbols as primitive and defined, and the introduction of a new modal operator (the truth operator) are the principal devices used to effect the development of these logics. The first two logics turn out to be "the same" as two of von Wright's systems.
    Download  
     
    Export citation  
     
    Bookmark  
  • When is a Schema Not a Schema? On a Remark by Suszko.Lloyd Humberstone & Allen Hazen - 2020 - Studia Logica 108 (2):199-220.
    A 1971 paper by Roman Suszko, ‘Identity Connective and Modality’, claimed that a certain identity-free schema expressed the condition that there are at most two objects in the domain. Section 1 here gives that schema and enough of the background to this claim to explain Suszko’s own interest in it and related conditions—via non-Fregean logic, in which the objects in question are situations and the aim is to refrain from imposing this condition. Section 3 shows that the claim is false, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The discovery of my completeness proofs.Leon Henkin - 1996 - Bulletin of Symbolic Logic 2 (2):127-158.
    §1. Introduction. This paper deals with aspects of my doctoral dissertation which contributed to the early development of model theory. What was of use to later workers was less the results of my thesis, than the method by which I proved the completeness of first-order logic—a result established by Kurt Gödel in his doctoral thesis 18 years before.The ideas that fed my discovery of this proof were mostly those I found in the teachings and writings of Alonzo Church. This may (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • The meaning of mathematical expressions: Does philosophy shed any light on psychology?Paul Ernest - 1990 - British Journal for the Philosophy of Science 41 (4):443-460.
    Mathematicians and physical scientists depend heavily on the formal symbolism of mathematics in order to express and develop their theories. For this and other reasons the last hundred years has seen a growing interest in the nature of formal language and the way it expresses meaning; particularly the objective, shared aspect of meaning as opposed to subjective, personal aspects. This dichotomy suggests the question: do the objective philosophical theories of meaning offer concepts which can be applied in psychological theories of (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Algebraic semantics for modal logics I.E. J. Lemmon - 1966 - Journal of Symbolic Logic 31 (1):46-65.
    Download  
     
    Export citation  
     
    Bookmark   53 citations  
  • How many premises can an argument have?G. C. Goddu - unknown
    Is it possible for an argument to have either zero premises or an infinite number of premises? I shall argue that regardless of how you conceive of arguments you should accept that an argument could have an infinite number of premises. The zero case is more complicated since the matter seems to depend not only on the metaphysics of arguments, but also the nature and function of arguing. I shall argue that at least a plausible case can be made for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Some structure results for propositional calculi.Ronald Harrop - 1965 - Journal of Symbolic Logic 30 (3):271-292.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Natural Deduction, Hybrid Systems and Modal Logics.Andrzej Indrzejczak - 2010 - Dordrecht, Netherland: Springer.
    This book provides a detailed exposition of one of the most practical and popular methods of proving theorems in logic, called Natural Deduction. It is presented both historically and systematically. Also some combinations with other known proof methods are explored. The initial part of the book deals with Classical Logic, whereas the rest is concerned with systems for several forms of Modal Logics, one of the most important branches of modern logic, which has wide applicability.
    Download  
     
    Export citation  
     
    Bookmark   13 citations  
  • Logical objects and the paradox of burali-Forti.A. Hazen - 1986 - Erkenntnis 24 (3):283 - 291.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On Harrop disjunction property in intermediate predicate logics.Katsumasa Ishii - 2023 - Archive for Mathematical Logic 63 (3):317-324.
    A partial solution to Ono’s problem P54 is given. Here Ono’s problem P54 is whether Harrop disjunction property is equivalent to disjunction property or not in intermediate predicate logics. As an application of this result it is shown that some intermediate predicate logics satisfy Harrop disjunction property.
    Download  
     
    Export citation  
     
    Bookmark  
  • Different senses of finitude: An inquiry into Hilbert’s finitism.Sören Stenlund - 2012 - Synthese 185 (3):335-363.
    This article develops a critical investigation of the epistemological core of Hilbert's foundational project, the so-called the finitary attitude. The investigation proceeds by distinguishing different senses of 'number' and 'finitude' that have been used in the philosophical arguments. The usual notion of modern pure mathematics, i.e. the sense of number which is implicit in the notion of an arbitrary finite sequence and iteration is one sense of number and finitude. Another sense, of older origin, is connected with practices of counting (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Unification in first-order transitive modal logic.Wojciech Dzik & Piotr Wojtylak - forthcoming - Logic Journal of the IGPL.
    Download  
     
    Export citation  
     
    Bookmark  
  • The judgement-stroke as a truth-operator: A new interpretation of the logical form of sentences in Frege's scientific language.D. Greimann - 2000 - Erkenntnis 52 (2):213-238.
    The syntax of Frege's scientific language is commonly taken to be characterized by two oddities: the representation of the intended illocutionary role of sentences by a special sign, the judgement-stroke, and the treatment of sentences as a species of singular terms. In this paper, an alternative view is defended. The main theses are: the syntax of Frege's scientific language aims at an explication of the logical form of judgements; the judgement-stroke is, therefore, a truth-operator, not a pragmatic operator; in Frege's (...)
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • (1 other version)Minimal Axioms for Peirce's Triadic Logic.Atwell R. Turquette - 1976 - Mathematical Logic Quarterly 22 (1):169-176.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Unification in superintuitionistic predicate logics and its applications.Wojciech Dzik & Piotr Wojtylak - 2019 - Review of Symbolic Logic 12 (1):37-61.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • (1 other version)An Extension of the Notion of Relativization to Hilbert's ε-Symbol.Masazumi Hanazawa - 1980 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (31):491-496.
    Download  
     
    Export citation  
     
    Bookmark