Switch to: References

Add citations

You must login to add citations.
  1. A generalization of the interpolation theorem for the many-sorted calculus.Krzysztof Rudnik - 1984 - Bulletin of the Section of Logic 13 (1):2-8.
    The purpose of the present paper is to prove the interpolation theorem for many-sorted languages which are, in terminology of Feferman neither restricted nor unrestricted. Such languages are often used in mathematical practice and have been investigated by several authors . The result is a generalization of the well-known Stern interpolation theorem for restricted m.s.l. and its proof depends heavily on that of Stern’s theorem. In place of the functions Rel + and Rel − our theorem treats the functions T (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Schrödinger Logics.Newton C. A. da Costa & Décio Krause - 1994 - Studia Logica 53 (4):533-550.
    Schrödinger logics are logical systems in which the principle of identity is not true in general. The intuitive motivation for these logics is both Erwin Schrödinger's thesis that identity lacks sense for elementary particles of modern physics, and the way which physicists deal with this concept; normally, they understand identity as meaning indistinguishability . Observing that these concepts are equivalent in classical logic and mathematics, which underly the usual physical theories, we present a higher-order logical system in which these concepts (...)
    Download  
     
    Export citation  
     
    Bookmark   13 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  
  • On a significance theory.R. Routley - 1966 - Australasian Journal of Philosophy 44 (2):172 – 209.
    Download  
     
    Export citation  
     
    Bookmark   20 citations  
  • A correspondence theorem for interpretability logic with respect to Verbrugge semantics.Sebastijan Horvat & Tin Perkov - forthcoming - Logic Journal of the IGPL.
    Interpretability logic is a modal logic that can be used to describe relative interpretability between extensions of a given first-order arithmetical theory. Verbrugge semantics is a generalization of the basic semantics for interpretability logic. Bisimulation is the basic equivalence between models for modal logic. The Van Benthem Correspondence Theorem establishes modal logic as the bisimulation invariant fragment of first-order logic. In this paper we show that a special type of bisimulations, the so-called w-bisimulations, enable an analogue of the Van Benthem (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Foundations of applied mathematics I.Jeffrey Ketland - 2021 - Synthese 199 (1-2):4151-4193.
    This paper aims to study the foundations of applied mathematics, using a formalized base theory for applied mathematics: ZFCAσ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$ \mathsf {ZFCA}_{\sigma }$$\end{document} with atoms, where the subscript used refers to a signature specific to the application. Examples are given, illustrating the following five features of applied mathematics: comprehension principles, application conditionals, representation hypotheses, transfer principles and abstract equivalents.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Proving semantic properties as first-order satisfiability.Salvador Lucas - 2019 - Artificial Intelligence 277 (C):103174.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • A note on temporal logic.Newton da Costa & Steven French - 1989 - Bulletin of the Section of Logic 18 (2):51-55.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • A non-reified temporal logic.Fahiem Bacchus, Josh Tenenberg & Johannes A. Koomen - 1991 - Artificial Intelligence 52 (1):87-108.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Syllogism and quantification.Timothy Smiley - 1962 - Journal of Symbolic Logic 27 (1):58-72.
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  • The Geach‐Kaplan sentence reconsidered.Kentaro Fujimoto - 2023 - Philosophy and Phenomenological Research 109 (1):288-314.
    The Geach‐Kaplan sentence is alleged to be an example of a non‐first‐orderizable sentence, and the proof of the alleged non‐first‐orderizability is credited to David Kaplan. However, there is also a widely shared intuition that the Geach‐Kaplan sentence is still first‐orderizable by invoking sets or other extra non‐logical resources. The plausibility of this intuition is particularly crucial for first‐orderism, namely, the thesis that all our scientific discourse and reasoning can be adequately formalized by first‐order logic. I first argue that the Geach‐Kaplan (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • An order-sorted logic for knowledge representation systems.C. Beierle, U. Hedtstück, U. Pletat, P. H. Schmitt & J. Siekmann - 1992 - Artificial Intelligence 55 (2-3):149-191.
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A mechanical solution of Schubert's Steamroller by many-sorted resolution.Christoph Walther - 1985 - Artificial Intelligence 26 (2):217-224.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Book Reviews. [REVIEW]Sari Nusseibeh, Gabriel Nuchelmans, Francisco A. Rodriguez-Consuegra, G. Lolli, D. P. Henry, Francis Jeffry Pelletier, George Rousspoulos, J. Woleński, B. Smith & Peter Simons - 1992 - History and Philosophy of Logic 13 (1):115-132.
    Al-Farahr’s commentarv and short treatise on Aristotle’s De interpretatione. Introduction and translation from Arabic by F. Zimmerman. Oxford: Published for the British Academy by Oxford University Press, 1987. clii + 287 pp. of English. £22.50 Johann Andreas Segner, Specimen logicae universaliter demonstrate. Appendices: Two dissertations De syllogismo. Edited by Mirella Capozzi. Bologna: Editrice CLUEB, 1990. clxxii + 281 pp. 85 000 Lire M. Borga, P. Fregugua And D. Palladino, I contribua fondazionali della scuola di Peano. Milano: Franco Angeli, 1985, 257 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Der deskriptive glaubensbegriff.Y. Nakayama - 1988 - Erkenntnis 28 (1):29 - 53.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Order-sorted logic programming with predicate hierarchy.Ken Kaneiwa - 2004 - Artificial Intelligence 158 (2):155-188.
    Download  
     
    Export citation  
     
    Bookmark   3 citations