Switch to: References

Add citations

You must login to add citations.
  1. Completeness and Categoricity. Part I: Nineteenth-century Axiomatics to Twentieth-century Metalogic.Steve Awodey & Erich H. Reck - 2002 - History and Philosophy of Logic 23 (1):1-30.
    This paper is the first in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   49 citations  
  • Alonzo church:his life, his work and some of his miracles.Maía Manzano - 1997 - History and Philosophy of Logic 18 (4):211-232.
    This paper is dedicated to Alonzo Church, who died in August 1995 after a long life devoted to logic. To Church we owe lambda calculus, the thesis bearing his name and the solution to the Entscheidungsproblem.His well-known book Introduction to Mathematical LogicI, defined the subject matter of mathematical logic, the approach to be taken and the basic topics addressed. Church was the creator of the Journal of Symbolic Logicthe best-known journal of the area, which he edited for several decades This (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • The compactness of first-order logic:from gödel to lindström.John W. Dawson - 1993 - History and Philosophy of Logic 14 (1):15-37.
    Though regarded today as one of the most important results in logic, the compactness theorem was largely ignored until nearly two decades after its discovery. This paper describes the vicissitudes of its evolution and transformation during the period 1930-1970, with special attention to the roles of Kurt Gödel, A. I. Maltsev, Leon Henkin, Abraham Robinson, and Alfred Tarski.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Domains of Sciences, Universes of Discourse and Omega Arguments.Jose M. Saguillo - 1999 - History and Philosophy of Logic 20 (3-4):267-290.
    Each science has its own domain of investigation, but one and the same science can be formalized in different languages with different universes of discourse. The concept of the domain of a science and the concept of the universe of discourse of a formalization of a science are distinct, although they often coincide in extension. In order to analyse the presuppositions and implications of choices of domain and universe, this article discusses the treatment of omega arguments in three very different (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Completeness and Categoricity: 19th Century Axiomatics to 21st Century Senatics.Steve Awodey & Erich H. Reck - 2002 - History and Philosophy of Logic 23 (1):1-30.
    Steve Awodey and Erich H. Reck. Completeness and Categoricity: 19th Century Axiomatics to 21st Century Senatics.
    Download  
     
    Export citation  
     
    Bookmark   24 citations  
  • A Semantics for Ontology.Peter M. Simons - 1985 - Dialectica 39 (3):193-215.
    SummaryLeśniewski presented his logical systems in a way which conformed to his nominalism, so the question arises whether Leśniewski's logic can be given a natural formal semantics which, unlike current versions, avoids commitment to abstract entities. Building on hints in Wittgenstein's Tractatus, I develop the idea of a way of meaning which is the basis for what I call combinatorial semantics. I then consider whether this commits us to abstract objects or an intensional metalogic.
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Strong logics of first and second order.Peter Koellner - 2010 - Bulletin of Symbolic Logic 16 (1):1-36.
    In this paper we investigate strong logics of first and second order that have certain absoluteness properties. We begin with an investigation of first order logic and the strong logics ω-logic and β-logic, isolating two facets of absoluteness, namely, generic invariance and faithfulness. It turns out that absoluteness is relative in the sense that stronger background assumptions secure greater degrees of absoluteness. Our aim is to investigate the hierarchies of strong logics of first and second order that are generically invariant (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Possible worlds: A critical analysis.Jaroslav Peregrin - unknown
    Frege has proposed to consider names as denoting objects, predicates as standing for concepts and sentences as denoting truth values. He was, however, aware that such denotation does not exhaust all what is to be said about meaning. Therefore he has urged that in addition to such denotation (Bedeutung) an expression has sense (Sinn). The sense is the "way of presentation" of denotation; hence the expressions Morning Star and Evening Star have identical denotations, but different senses. Carnap has proposed to (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Games: Unifying Logic, Language, and Philosophy.Ondrej Majer, Ahti-Veikko Pietarinen & Tero Tulenheimo (eds.) - 2009 - Dordrecht, Netherland: Springer Verlag.
    This volume presents mathematical game theory as an interface between logic and philosophy.
    Download  
     
    Export citation  
     
    Bookmark  
  • Lesniewski and Russell's paradox: Some problems.Rafal Urbaniak - 2008 - History and Philosophy of Logic 29 (2):115-146.
    Sobocinski in his paper on Leśniewski's solution to Russell's paradox (1949b) argued that Leśniewski has succeeded in explaining it away. The general strategy of this alleged explanation is presented. The key element of this attempt is the distinction between the collective (mereological) and the distributive (set-theoretic) understanding of the set. The mereological part of the solution, although correct, is likely to fall short of providing foundations of mathematics. I argue that the remaining part of the solution which suggests a specific (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Higher-order automated theorem proving.Michael Kohlhase - unknown
    The history of building automated theorem provers for higher-order logic is almost as old as the field of deduction systems itself. The first successful attempts to mechanize and implement higher-order logic were those of Huet [13] and Jensen and Pietrzykowski [17]. They combine the resolution principle for higher-order logic (first studied in [1]) with higher-order unification. The unification problem in typed λ-calculi is much more complex than that for first-order terms, since it has to take the theory of αβη-equality into (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • logicism, intuitionism, and formalism - What has become of them?Sten Lindstr©œm, Erik Palmgren, Krister Segerberg & Viggo Stoltenberg-Hansen (eds.) - 2008 - Berlin, Germany: Springer.
    The period in the foundations of mathematics that started in 1879 with the publication of Frege's Begriffsschrift and ended in 1931 with Gödel's Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I can reasonably be called the classical period. It saw the development of three major foundational programmes: the logicism of Frege, Russell and Whitehead, the intuitionism of Brouwer, and Hilbert's formalist and proof-theoretic programme. In this period, there were also lively exchanges between the various schools culminating in (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • From if to bi.Samson Abramsky & Jouko Väänänen - 2009 - Synthese 167 (2):207 - 230.
    We take a fresh look at the logics of informational dependence and independence of Hintikka and Sandu and Väänänen, and their compositional semantics due to Hodges. We show how Hodges’ semantics can be seen as a special case of a general construction, which provides a context for a useful completeness theorem with respect to a wider class of models. We shed some new light on each aspect of the logic. We show that the natural propositional logic carried by the semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   31 citations  
  • Language and its Models: Is Model Theory a Theory of Semantics?Jaroslav Peregrin - 1997 - Nordic Journal of Philosophical Logic 2 (1):1-23.
    Tarskian model theory is almost universally understood as a formal counterpart of the preformal notion of semantics, of the “linkage between words and things”. The wide-spread opinion is that to account for the semantics of natural language is to furnish its settheoretic interpretation in a suitable model structure; as exemplified by Montague 1974.
    Download  
     
    Export citation  
     
    Bookmark   14 citations  
  • System description: { A higher-order theorem prover?Michael Kohlhase - manuscript
    Thus, despite the di culty of higher-order automated theorem proving, which has to deal with problems like the undecidability of higher-order uni - cation (HOU) and the need for primitive substitution, there are proof problems which lie beyond the capabilities of rst-order theorem provers, but instead can be solved easily by an higher-order theorem prover (HOATP) like Leo. This is due to the expressiveness of higher-order Logic and, in the special case of Leo, due to an appropriate handling of the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Abstract objects.Gideon Rosen - 2008 - Stanford Encyclopedia of Philosophy.
    Download  
     
    Export citation  
     
    Bookmark   93 citations  
  • Hyperfine-grained meanings in classical logic.Reinhard Muskens - 1991 - Logique Et Analyse 133:159-176.
    This paper develops a semantics for a fragment of English that is based on the idea of `impossible possible worlds'. This idea has earlier been formulated by authors such as Montague, Cresswell, Hintikka, and Rantala, but the present set-up shows how it can be formalized in a completely unproblematic logic---the ordinary classical theory of types. The theory is put to use in an account of propositional attitudes that is `hyperfine-grained', i.e. that does not suffer from the well-known problems involved with (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Program semantics and classical logic.Reinhard Muskens - 1997) - In CLAUS Report Nr 86. Saarbrücken: University of the Saarland. pp. 1-27.
    In the tradition of Denotational Semantics one usually lets program constructs take their denotations in reflexive domains, i.e. in domains where self-application is possible. For the bulk of programming constructs, however, working with reflexive domains is an unnecessary complication. In this paper we shall use the domains of ordinary classical type logic to provide the semantics of a simple programming language containing choice and recursion. We prove that the rule of {\em Scott Induction\/} holds in this new setting, prove soundness (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Completeness and categoricty, part II: 20th century metalogic to 21st century semantics.Steve Awodey & Erich H. Reck - 2002 - History and Philosophy of Logic 23 (1):77-92.
    This paper is the second in a two-part series in which we discuss several notions of completeness for systems of mathematical axioms, with special focus on their interrelations and historical origins in the development of the axiomatic method. We argue that, both from historical and logical points of view, higher-order logic is an appropriate framework for considering such notions, and we consider some open questions in higher-order axiomatics. In addition, we indicate how one can fruitfully extend the usual set-theoretic semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Free quantification and logical invariance.G. Aldo Antonelli - 2007 - Rivista di Estetica 33 (1):61-73.
    Henry Leonard and Karel Lambert first introduced so-called presupposition-free (or just simply: free) logics in the 1950’s in order to provide a logical framework allowing for non-denoting singular terms (be they descriptions or constants) such as “the largest prime” or “Pegasus” (see Leonard [1956] and Lambert [1960]). Of course, ever since Russell’s paradigmatic treatment of definite descriptions (Russell [1905]), philosophers have had a way to deal with such terms. A sentence such as “the..
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Strict coherence, sigma coherence and the metaphysics of quantity.Brian Skyrms - 1995 - Philosophical Studies 77 (1):39-55.
    Download  
     
    Export citation  
     
    Bookmark   19 citations  
  • A note on Carnap's meaning criterion.William W. Rozeboom - 1960 - Philosophical Studies 11 (3):33 - 38.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A survey of formal semantics.Robert Rogers - 1963 - Synthese 15 (1):17 - 56.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Reply to “arthur Pap on meaning rules”.Arthur Pap - 1960 - Philosophical Studies 11 (3):38 - 41.
    Download  
     
    Export citation  
     
    Bookmark  
  • The metaphysics of quantity.Brent Mundy - 1987 - Philosophical Studies 51 (1):29 - 54.
    A formal theory of quantity T Q is presented which is realist, Platonist, and syntactically second-order (while logically elementary), in contrast with the existing formal theories of quantity developed within the theory of measurement, which are empiricist, nominalist, and syntactically first-order (while logically non-elementary). T Q is shown to be formally and empirically adequate as a theory of quantity, and is argued to be scientifically superior to the existing first-order theories of quantity in that it does not depend upon empirically (...)
    Download  
     
    Export citation  
     
    Bookmark   80 citations  
  • A Cantorian argument against infinitesimals.Matthew E. Moore - 2002 - Synthese 133 (3):305 - 330.
    In 1887 Georg Cantor gave an influential but cryptic proof of theimpossibility of infinitesimals. I first give a reconstruction ofCantor's argument which relies mainly on traditional assumptions fromEuclidean geometry, together with elementary results of Cantor's ownset theory. I then apply the reconstructed argument to theinfinitesimals of Abraham Robinson's nonstandard analysis. Thisbrings out the importance for the argument of an assumption I call theChain Thesis. Doubts about the Chain Thesis are seen to render thereconstructed argument inconclusive as an attack on the (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Pragmatics and intensional logic.Richard Montague - 1970 - Synthese 22 (1-2):68--94.
    Download  
     
    Export citation  
     
    Bookmark   84 citations  
  • Dunn’s relevant predication, real properties and identity.Philip Kremer - 1997 - Erkenntnis 47 (1):37-65.
    We critically investigate and refine Dunn's relevant predication, his formalisation of the notion of a real property. We argue that Dunn's original dialectical moves presuppose some interpretation of relevant identity, though none is given. We then re-motivate the proposal in a broader context, considering the prospects for a classical formalisation of real properties, particularly of Geach's implicit distinction between real and ''Cambridge'' properties. After arguing against these prospects, we turn to relevance logic, re-motivating relevant predication with Geach's distinction in mind. (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Analyticity versus fuzziness.John G. Kemeny - 1963 - Synthese 15 (1):57 - 80.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • On göde's philosophical assumptions.Jaakko Hintikka - 1998 - Synthese 114 (1):13-23.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • A revolution in the foundations of mathematics?Jaakko Hintikka - 1997 - Synthese 111 (2):155-170.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Carnap's work in the foundations of logic and mathematics in a historical perspective.Jaakko Hintikka - 1992 - Synthese 93 (1-2):167 - 189.
    Carnap's philosophy is examined from new viewpoints, including three important distinctions: (i) language as calculus vs language as universal medium; (ii) different senses of completeness: (iii) standard vs nonstandard interpretations of (higher-order) logic. (i) Carnap favored in 1930-34 the "formal mode of speech," a corollary to the universality assumption. He later gave it up partially but retained some of its ingredients, e.g., the one-domain assumption. (ii) Carnap's project of creating a universal self-referential language is encouraged by (ii) and by the (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • The three arrows of Zeno.Craig Harrison - 1996 - Synthese 107 (2):271 - 292.
    We explore the better known paradoxes of Zeno including modern variants based on infinite processes, from the point of view of standard, classical analysis, from which there is still much to learn (especially concerning the paradox of division), and then from the viewpoints of non-standard and non-classical analysis (the logic of the latter being intuitionist).The standard, classical or Cantorian notion of the continuum, modeled on the real number line, is well known, as is the definition of motion as the time (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • Am anfang war die tat.Wilhelm K. Essler - 1996 - Erkenntnis 44 (3):257 - 277.
    First, the paper argues that Tarski's theory of language levels is best understood not only as a method for avoiding semantic paradoxes by rigidly restricting the expressive power of a language, but as a natural expression of an epistemological process of reflection which is more adequately understood as a process and not by its result. Second, it is argued that the apparent philosophical controversy between materialism and idealism dissolves whithin this process of reflection. If one has raised above the lowest (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • The transzendenz of mathematical 'experience'.William Boos - 1998 - Synthese 114 (1):49-98.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Limits of inquiry.William Boos - 1983 - Erkenntnis 20 (2):157 - 194.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Consistency and konsistenz.William Boos - 1987 - Erkenntnis 26 (1):1 - 43.
    A ground-motive for this study of some historical and metaphysical implications of the diagonal lemmas of Cantor and Gödel is Cantor's insightful remark to Dedekind in 1899 that the Inbegriff alles Denkbaren (aggregate of everything thinkable) might, like some class-theoretic entities, be inkonsistent. In the essay's opening sections, I trace some recent antecedents of Cantor's observation in logical writings of Bolzano and Dedekind (more remote counterparts of his language appear in the First Critique), then attempt to relativize the notion of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Models and modality.Patricia A. Blanchette - 2000 - Synthese 124 (1-2):45-72.
    This paper examines the connection between model-theoretic truth and necessary truth. It is argued that though the model-theoretic truths of some standard languages are demonstrably ''''necessary'''' (in a precise sense), the widespread view of model-theoretic truth as providing a general guarantee of necessity is mistaken. Several arguments to the contrary are criticized.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Critical notice.J. F. A. K. Benthem - 1979 - Synthese 40 (2):353-373.
    Gabbay has gathered an enormous amount of results; some of them important and novel, others important but already known, many rather routine, however. The organization of this material shows grave defects, both in the exposition and in its logical structure. Intensional logic appears as a vast collection of (often duplicated) loosely connected results. This may be a true reflection of the present state of the subject, but it does not contribute to a better understanding of it, let alone advance it.
    Download  
     
    Export citation  
     
    Bookmark  
  • Higher Order Modal Logic.Reinhard Muskens - 2006 - In Patrick Blackburn, Johan Van Benthem & Frank Wolter (eds.), Handbook of Modal Logic. Elsevier. pp. 621-653.
    A logic is called higher order if it allows for quantification over higher order objects, such as functions of individuals, relations between individuals, functions of functions, relations between functions, etc. Higher order logic began with Frege, was formalized in Russell [46] and Whitehead and Russell [52] early in the previous century, and received its canonical formulation in Church [14].1 While classical type theory has since long been overshadowed by set theory as a foundation of mathematics, recent decades have shown remarkable (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • Intensional models for the theory of types.Reinhard Muskens - 2007 - Journal of Symbolic Logic 72 (1):98-118.
    In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not validate the axiom of Extensionality. We give a cut-free sequent calculus for type theory and show completeness of this calculus with respect to the class of intensional models via a model existence theorem. After this we turn our attention to applications. Firstly, it (...)
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • A 'natural logic' inference system using the Lambek calculus.Anna Zamansky, Nissim Francez & Yoad Winter - 2006 - Journal of Logic, Language and Information 15 (3):273-295.
    This paper develops an inference system for natural language within the ‘Natural Logic’ paradigm as advocated by van Benthem, Sánchez and others. The system that we propose is based on the Lambek calculus and works directly on the Curry-Howard counterparts for syntactic representations of natural language, with no intermediate translation to logical formulae. The Lambek -based system we propose extends the system by Fyodorov et~al., which is based on the Ajdukiewicz/Bar-Hillel calculus Bar Hillel,. This enables the system to deal with (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Eligibility and inscrutability.J. Robert G. Williams - 2007 - Philosophical Review 116 (3):361-399.
    Inscrutability arguments threaten to reduce interpretationist metasemantic theories to absurdity. Can we find some way to block the arguments? A highly influential proposal in this regard is David Lewis’ ‘ eligibility ’ response: some theories are better than others, not because they fit the data better, but because they are framed in terms of more natural properties. The purposes of this paper are to outline the nature of the eligibility proposal, making the case that it is not ad hoc, but (...)
    Download  
     
    Export citation  
     
    Bookmark   87 citations  
  • Second-order logic and foundations of mathematics.Jouko Väänänen - 2001 - Bulletin of Symbolic Logic 7 (4):504-520.
    We discuss the differences between first-order set theory and second-order logic as a foundation for mathematics. We analyse these languages in terms of two levels of formalization. The analysis shows that if second-order logic is understood in its full semantics capable of characterizing categorically central mathematical concepts, it relies entirely on informal reasoning. On the other hand, if it is given a weak semantics, it loses its power in expressing concepts categorically. First-order set theory and second-order logic are not radically (...)
    Download  
     
    Export citation  
     
    Bookmark   51 citations  
  • Two suggestions for Ramsey-reducts of infinite theories.Zeno G. Swijtink - 1976 - Philosophy of Science 43 (4):575-577.
    Download  
     
    Export citation  
     
    Bookmark  
  • Hybrid terms and sentences.Dietmar Schweigert - 1993 - Studia Logica 52 (3):405 - 417.
    In the paper we present completeness theorems for hybrid logics, discuss the problem of finite axiomatization and study term rewriting and unification for the variety of distributive lattices and the variety of groups of exponent 2.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Is “some-other-time” sometimes better than “sometime” for proving partial correctness of programs?Ildikó Sain - 1988 - Studia Logica 47 (3):279 - 301.
    The main result of this paper belongs to the field of the comparative study of program verification methods as well as to the field called nonstandard logics of programs. We compare the program verifying powers of various well-known temporal logics of programs, one of which is the Intermittent Assertions Method, denoted as Bur. Bur is based on one of the simplest modal logics called S5 or sometime-logic. We will see that the minor change in this background modal logic increases the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Universal semantics?Richard Routley - 1975 - Journal of Philosophical Logic 4 (3):327 - 356.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Choice and descriptions in enriched intensional languages — I.R. Routley, R. K. Meyer & L. Goddard - 1974 - Journal of Philosophical Logic 3 (3):291 - 316.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • A relational formulation of the theory of types.Reinhard Muskens - 1989 - Linguistics and Philosophy 12 (3):325 - 346.
    This paper developes a relational---as opposed to a functional---theory of types. The theory is based on Hilbert and Bernays' eta operator plus the identity symbol, from which Church's lambda and the other usual operators are then defined. The logic is intended for use in the semantics of natural language.
    Download  
     
    Export citation  
     
    Bookmark   8 citations