Switch to: References

Add citations

You must login to add citations.
  1. Cambridge and Vienna: Frank P. Ramsey and the Vienna Circle.Maria Carla Galavotti (ed.) - 2004 - Dordrecht: Springer Verlag.
    The Institute Vienna Circle held a conference in Vienna in 2003, Cambridge and Vienna a?
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Reciprocal Influences Between Proof Theory and Logic Programming.Dale Miller - 2019 - Philosophy and Technology 34 (1):75-104.
    The topics of structural proof theory and logic programming have influenced each other for more than three decades. Proof theory has contributed the notion of sequent calculus, linear logic, and higher-order quantification. Logic programming has introduced new normal forms of proofs and forced the examination of logic-based approaches to the treatment of bindings. As a result, proof theory has responded by developing an approach to proof search based on focused proof systems in which introduction rules are organized into two alternating (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Visions of Henkin.María Manzano & Enrique Alonso - 2015 - Synthese 192 (7):2123-2138.
    Leon Henkin (1921–2006) was not only an extraordinary logician, but also an excellent teacher, a dedicated professor and an exceptional person. The first two sections of this paper are biographical, discussing both his personal and academic life. In the last section we present three aspects of Henkin’s work. First we comment part of his work fruit of his emphasis on teaching. In a personal communication he affirms that On mathematical induction, published in 1969, was the favourite among his articles with (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Identity, Equality, Nameability and Completeness.María Manzano & Manuel Crescencio Moreno - 2017 - Bulletin of the Section of Logic 46 (3/4).
    This article is an extended promenade strolling along the winding roads of identity, equality, nameability and completeness, looking for places where they converge. We have distinguished between identity and equality; the first is a binary relation between objects while the second is a symbolic relation between terms. Owing to the central role the notion of identity plays in logic, you can be interested either in how to define it using other logical concepts or in the opposite scheme. In the first (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Much Ado About the Many.Jonathan Mai - 2021 - Principia: An International Journal of Epistemology 25 (1).
    English distinguishes between singular quantifiers like "a donkey" and plural quantifiers like "some donkeys". Pluralists hold that plural quantifiers range in an unusual, irreducibly plural, way over common objects, namely individuals from first-order domains and not over set-like objects. The favoured framework of pluralism is plural first-order logic, PFO, an interpreted first-order language that is capable of expressing plural quantification. Pluralists argue for their position by claiming that the standard formal theory based on PFO is both ontologically neutral and really (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Looking backwards in type logic.Jan Köpping & Thomas Ede Zimmermann - 2021 - Inquiry: An Interdisciplinary Journal of Philosophy 64 (5-6):646-672.
    ABSTRACT Backwards-looking operators Saarinen, E. [1979. “Backwards-Looking Operators in Tense Logic and in Natural Language.” In Essays on Mathematical and Philosophical Logic, edited by J. Hintikka, I. Niiniluoto, and E. Saarinen, 341–367. Dordrecht: Reidel] that have the material in their scope depend on higher intensional operators, are known to increase the expressivity of some intensional languages and have thus played a central role in debates about approaches to intensionality in terms of implicit parameters vs. variables explicitly quantifying over them. The (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Substitution contradiction, its resolution and the Church-Rosser Theorem in TIL.Miloš Kosterec - 2020 - Journal of Philosophical Logic 49 (1):121-133.
    I present an analysis according to which the current state of the definition of substitution leads to a contradiction in the system of Transparent Intensional Logic. I entail the contradiction using only the basic definitions of TIL and standard results. I then analyse the roots of the contradiction and motivate the path I take in resolving the contradiction. I provide a new amended definition of collision-less substitution which blocks the contradiction in a non-ad hoc way. I elaborate on the consequences (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • The Cooper Storage Idiom.Gregory M. Kobele - 2018 - Journal of Logic, Language and Information 27 (2):95-131.
    Cooper storage is a widespread technique for associating sentences with their meanings, used in diverse linguistic and computational linguistic traditions. This paper encodes the data structures and operations of cooper storage in the simply typed linear \-calculus, revealing the rich categorical structure of a graded applicative functor. In the case of finite cooper storage, which corresponds to ideas in current transformational approaches to syntax, the semantic interpretation function can be given as a linear homomorphism acting on a regular set of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Standard Formalization.Jeffrey Ketland - 2022 - Axiomathes 32 (3):711-748.
    A standard formalization of a scientific theory is a system of axioms for that theory in a first-order language (possibly many-sorted; possibly with the membership primitive $$\in$$ ). Suppes (in: Carvallo M (ed) Nature, cognition and system II. Kluwer, Dordrecht, 1992) expressed skepticism about whether there is a “simple or elegant method” for presenting mathematicized scientific theories in such a standard formalization, because they “assume a great deal of mathematics as part of their substructure”. The major difficulties amount to these. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Type-theoretic logic with an operational account of intensionality.Shalom Lappin & Chris Fox - 2015 - Synthese 192 (3):563-584.
    We formulate a Curry-typed logic with fine-grained intensionality within Turner’s typed predicate logic. This allows for an elegant presentation of a theory that corresponds to Fox and Lappin’s property theory with curry typing, but without the need for a federation of languages. We then consider how the fine-grained intensionality of this theory can be given an operational interpretation. This interpretation suggests itself as expressions in the theory can be viewed as terms in the untyped lambda-calculus, which provides a model of (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A note on the use of lamda conversion in generalized phrase structure grammars.Elisabet Engdahl - 1980 - Linguistics and Philosophy 4 (4):505 - 515.
    The restrictive grammatical format suggested in GPSG provides an extremely interesting alternative to transformational approaches to grammar. However, we have seen that the way the grammar is currently organized, it will in certain cases fail to give the correct interpretation to sentences with displaced constituents. Whenever a left or rightward displaced constituent contains an element that can stand in an anaphoric relation with some other element in the sentence, i.e. contains a quantifier or a pronoun, the semantic rules as given (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The prehistory of the subsystems of second-order arithmetic.Walter Dean & Sean Walsh - 2017 - Review of Symbolic Logic 10 (2):357-396.
    This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long arc from Poincar\'e to Feferman as concerns arithmetic definability and provability, (ii) the interplay between finitism and the formalization of analysis in the lecture notes and publications of Hilbert and Bernays, (iii) the uncertainty as to the constructive status of principles equivalent to Weak K\"onig's (...)
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Glivenko and Kuroda for simple type theory.Chad E. Brown & Christine Rizkallah - 2014 - Journal of Symbolic Logic 79 (2):485-495.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The impact of the lambda calculus in logic and computer science.Henk Barendregt - 1997 - Bulletin of Symbolic Logic 3 (2):181-215.
    One of the most important contributions of A. Church to logic is his invention of the lambda calculus. We present the genesis of this theory and its two major areas of application: the representation of computations and the resulting functional programming languages on the one hand and the representation of reasoning and the resulting systems of computer mathematics on the other hand.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Truth-conditional pragmatics: an overview.Francois Recanati - 2008 - In Paolo Bouquet, Luciano Serafini & Richmond H. Thomason (eds.), Perspectives on Contexts. Center for the Study of Language and Inf. pp. 171-188.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Úvod do teoretické sémantiky.Jaroslav Peregrin - manuscript
    Když jsem v roce 1992 začínal na filosofické fakultě UK přednášet teorii sémantiky, cítil jsem intenzivní potřebu poskytnout studentům nějaký učební text. O překotném vývoji tohoto interdisciplinárního oboru, který odstartovalo v sedmdesátých letech úspěšné “zkřížení logiky s lingvistikou” Richardem Montaguem a dalšími a který se nezpomalil dodnes, totiž v češtině neexistovaly prakticky žádné zprávy (s čestnou výjimkou přístupu tzv. transparentní intenzionální logiky, který byl dílem českého emigranta Pavla Tichého a o kterém u nás psal Pavel Materna). Přehledové publikace, jaké jsou (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • A Brief History of Fuzzy Logic in the Czech Republic and Significance of P. Hájek for Its Development.Vilém Novák - 2017 - Archives for the Philosophy and History of Soft Computing 2017 (1).
    In this paper, we will briefly look at the history of mathematical fuzzy logic in Czechoslovakia starting from the 1970s and extending until 2009. The role of P. Ha ́jek in the development of fuzzy logic is especially emphasized.
    Download  
     
    Export citation  
     
    Bookmark  
  • An Introduction to a Theory of Abstract Objects.Edward Nouri Zalta - 1981 - Dissertation, University of Massachusetts Amherst
    An axiomatic theory of abstract objects is developed and used to construct models of Plato's Forms, Leibniz's Monads, Possible Worlds, Frege's Senses, stories, and fictional characters. The theory takes six primitive metaphysical notions: object ; n-place relations ,G,...); x,...x exemplify F x...x); x exists ; it is necessary that "); and x encodes F "). Properties and propositions are one place and zero place relations, respectively.objects are objects which necessarily fail to exist E!x"). The two most important proper axioms are (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • The liar and the new t-schema.Stephen Read - 2010 - Discusiones Filosóficas 11 (17):119-137.
    Desde que Tarski publicó su estudio sobreel concepto de verdad en los años 30, hasido una práctica ortodoxa el considerarque t oda i nst anci a del esquema T esverdadera. Sin embargo, algunas instanciasdel esquema son falsas. Éstas incluyen lasi nst anci as paradój i cas ej empl i f i cadaspor la oración del mentiroso. Aquí sedemuestra que un esquema mejor permiteun tratamiento uniforme de la verdad enel que las paradojas semánticas resultanser simplemente falsas.Si nc e Ta r s (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Automating Emendations of the Ontological Argument in Intensional Higher-Order Modal Logic.Fuenmayor David & Benzmüller Christoph - 2017 - In David Fuenmayor & Christoph Benzmüller (eds.), KI 2017: Advances in Artificial Intelligence 40th Annual German Conference on AI. Springer International Publishing.
    A shallow semantic embedding of an intensional higher-order modal logic in Isabelle/HOL is presented. IHOML draws on Montague/Gallin intensional logics and has been introduced by Melvin Fitting in his textbook Types, Tableaus and Gödel’s God in order to discuss his emendation of Gödel’s ontological argument for the existence of God. Utilizing IHOML, the most interesting parts of Fitting’s textbook are formalized, automated and verified in the Isabelle/HOL proof assistant. A particular focus thereby is on three variants of the ontological argument (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Higher-order Aspects and Context in SUMO.Christoph Benzmüller & Adam Pease - 2012 - Journal of Web Semantics 12:104-117.
    Download  
     
    Export citation  
     
    Bookmark  
  • Sweet SIXTEEN: Automation via Embedding into Classical Higher-Order Logic.Alexander Steen & Christoph Benzmüller - 2016 - Logic and Logical Philosophy 25 (4):535-554.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Universal Reasoning, Rational Argumentation and Human-Machine Interaction.Benzmüller Christoph - 2017
    Classical higher-order logic, when utilized as a meta-logic in which various other logics can be shallowly embedded, is well suited for realising a universal logic reasoning approach. Universal logic reasoning in turn, as envisioned already by Leibniz, may support the rigorous formalisation and deep logical analysis of rational arguments within machines. A respective universal logic reasoning framework is described and a range of exemplary applications are discussed. In the future, universal logic reasoning in combination with appropriate, controlled forms of rational (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Leśniewski's Systems of Logic and Foundations of Mathematics.Rafal Urbaniak - 2013 - Cham, Switzerland: Springer.
    With material on his early philosophical views, his contributions to set theory and his work on nominalism and higher-order quantification, this book offers a uniquely expansive critical commentary on one of analytical philosophy’s great ...
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  • Variables in Natural Language: Where Do They Come From?'.Jaroslav Peregrin - 2000 - In Michael Böttner & Wolf Thümmel (eds.), Variable-free semantics. Osnabrück: Secolo. pp. 46--65.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Recent Successes with a Meta-Logical Approach to Universal Logical Reasoning.Benzmüller Christoph - 2017 - In Christoph Benzmüller (ed.), Lecture Notes in Computer Science: Formal Methods: Foundations and Applications - 20th Brazilian Symposium SBMF 2017, Recife, Brazil, November 29 - December 1, 2017, Proceedings. Springer. pp. 7-11.
    The quest for a most general framework supporting universal reasoning is very prominently represented in the works of Leibniz. He envisioned a scientia generalis founded on a characteristica universalis, that is, a most universal formal language in which all knowledge about the world and the sciences can be encoded. A quick study of the survey literature on logical formalisms suggests that quite the opposite to Leibniz’ dream has become reality. Instead of a characteristica universalis, we are today facing a very (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • ALONZO: Deduktionsagenten höherer Ordnung für Mathematische Assistenzsysteme.Benzmüller Christoph - 2003
    Download  
     
    Export citation  
     
    Bookmark  
  • Embedding and Automating Conditional Logics in Classical Higher-Order Logic.Christoph Benzmüller, Dov Gabbay, Valerio Genovese & Daniele Rispoli - 2012 - Annals of Mathematics and Artificial Intelligence 66 (1-4):257-271.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Automated reasoning in higher-order logic using the tptp thf infrastructure.Sutcliffe Geoff & Benzmüller Christoph - 2010 - Journal of Formalized Reasoning 3 (1):1-27.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Logical Grammar.Glyn Morrill - 2012 - In Ruth M. Kempson, Tim Fernando & Nicholas Asher (eds.), Philosophy of linguistics. Boston: North Holland. pp. 63.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • 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  
  • Carnap a jazyk: z Viedne do Santa Fé.Igor Hanzel - 2007 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 14 (4):470-497.
    The paper reconstructs three main stages in the development of Carnap’s approach to language in the years 1931 – 1947. It starts with Carnap’s approach to metalogic in his Viennese Zirkelprotokolle and his Logische Syntax der Sprache from the point of view of one-level approach to the relation between metalanguage and its object-language. It then analyzes Tarski’s turn to semantics in his paper presented at the Paris conference in September 1935, as well as the implications of his view for Carnap’s (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Pozoruhodné logické systémy.Jaroslav Peregrin - 2000 - Organon F: Medzinárodný Časopis Pre Analytickú Filozofiu 8:90-96.
    Download  
     
    Export citation  
     
    Bookmark