Results for ' first-order logic with fixed-points'

931 found
Order:
  1. On the expressive power of first-order modal logic with two-dimensional operators.Alexander W. Kocurek - 2018 - Synthese 195 (10):4373-4417.
    Many authors have noted that there are types of English modal sentences cannot be formalized in the language of basic first-order modal logic. Some widely discussed examples include “There could have been things other than there actually are” and “Everyone who is actually rich could have been poor.” In response to this lack of expressive power, many authors have discussed extensions of first-order modal logic with two-dimensional operators. But claims about the relative expressive (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  2. Paraconsistent First-Order Logic with infinite hierarchy levels of contradiction.Jaykov Foukzon - manuscript
    In this paper paraconsistent first-order logic LP^{#} with infinite hierarchy levels of contradiction is proposed. Corresponding paraconsistent set theory KSth^{#} is discussed.Axiomatical system HST^{#}as paraconsistent generalization of Hrbacek set theory HST is considered.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  3. Fixed-Point Posets in Theories of Truth.Stephen Mackereth - 2019 - Journal of Philosophical Logic (1).
    We show that any coherent complete partial order is obtainable as the fixed-point poset of the strong Kleene jump of a suitably chosen first-order ground model. This is a strengthening of Visser’s result that any finite ccpo is obtainable in this way. The same is true for the van Fraassen supervaluation jump, but not for the weak Kleene jump.
    Download  
     
    Export citation  
     
    Bookmark  
  4. Diagonal arguments and fixed points.Saeed Salehi - 2017 - Bulletin of the Iranian Mathematical Society 43 (5):1073-1088.
    ‎A universal schema for diagonalization was popularized by N. S‎. ‎Yanofsky (2003)‎, ‎based on a pioneering work of F.W‎. ‎Lawvere (1969)‎, ‎in which the existence of a (diagonolized-out and contradictory) object implies the existence of a fixed-point for a certain function‎. ‎It was shown that many self-referential paradoxes and diagonally proved theorems can fit in that schema‎. ‎Here‎, ‎we fit more theorems in the universal‎ ‎schema of diagonalization‎, ‎such as Euclid's proof for the infinitude of the primes and new (...)
    Download  
     
    Export citation  
     
    Bookmark  
  5. Modeling the concept of truth using the largest intrinsic fixed point of the strong Kleene three valued semantics (in Croatian language).Boris Culina - 2004 - Dissertation, University of Zagreb
    The thesis deals with the concept of truth and the paradoxes of truth. Philosophical theories usually consider the concept of truth from a wider perspective. They are concerned with questions such as - Is there any connection between the truth and the world? And, if there is - What is the nature of the connection? Contrary to these theories, this analysis is of a logical nature. It deals with the internal semantic structure of language, the mutual semantic (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  6.  34
    Inferential Quantification and the ω-Rule.Constantin C. Brîncuş - 2024 - In Antonio Piccolomini D'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction. Springer Verlag. pp. 345-372.
    Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational (...)
    Download  
     
    Export citation  
     
    Bookmark  
  7. In Defence of Discrete Plural Logic (or How to Avoid Logical Overmedication When Dealing with Internally Singularized Pluralities).Gustavo Picazo - 2022 - Disputatio 14 (64):51-63.
    In recent decades, plural logic has established itself as a well-respected member of the extensions of first-order classical logic. In the present paper, I draw attention to the fact that among the examples that are commonly given in order to motivate the need for this new logical system, there are some in which the elements of the plurality in question are internally singularized (e.g. ‘Whitehead and Russell wrote Principia Mathematica’), while in others they are not (...)
    Download  
     
    Export citation  
     
    Bookmark  
  8. (1 other version)Property Theories.George Bealer & Uwe Mönnich - 1983 - In Dov M. Gabbay & Franz Guenthner (eds.), Handbook of Philosophical Logic. Dordrecht, Netherland: Kluwer Academic Publishers. pp. 133-251.
    Revised and reprinted in Handbook of Philosophical Logic, volume 10, Dov Gabbay and Frans Guenthner (eds.), Dordrecht: Kluwer, (2003). -- Two sorts of property theory are distinguished, those dealing with intensional contexts property abstracts (infinitive and gerundive phrases) and proposition abstracts (‘that’-clauses) and those dealing with predication (or instantiation) relations. The first is deemed to be epistemologically more primary, for “the argument from intensional logic” is perhaps the best argument for the existence of properties. This (...)
    Download  
     
    Export citation  
     
    Bookmark   23 citations  
  9. Inferential Quantification and the ω-rule.Constantin C. Brîncuş - 2024 - In Antonio Piccolomini D'Aragona (ed.), Perspectives on Deduction: Contemporary Studies in the Philosophy, History and Formal Theories of Deduction. Springer Verlag. pp. 345--372.
    Logical inferentialism maintains that the formal rules of inference fix the meanings of the logical terms. The categoricity problem points out to the fact that the standard formalizations of classical logic do not uniquely determine the intended meanings of its logical terms, i.e., these formalizations are not categorical. This means that there are different interpretations of the logical terms that are consistent with the relation of logical derivability in a logical calculus. In the case of the quantificational (...)
    Download  
     
    Export citation  
     
    Bookmark  
  10. (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  
  11. Philosophical Accounts of First-Order Logical Truths.Constantin C. Brîncuş - 2019 - Acta Analytica 34 (3):369-383.
    Starting from certain metalogical results, I argue that first-order logical truths of classical logic are a priori and necessary. Afterwards, I formulate two arguments for the idea that first-order logical truths are also analytic, namely, I first argue that there is a conceptual connection between aprioricity, necessity, and analyticity, such that aprioricity together with necessity entails analyticity; then, I argue that the structure of natural deduction systems for FOL displays the analyticity of its (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  12. First-Order Logic and Some Existential Sentences.Stephen K. McLeod - 2011 - Disputatio 4 (31):255-270.
    ‘Quantified pure existentials’ are sentences (e.g., ‘Some things do not exist’) which meet these conditions: (i) the verb EXIST is contained in, and is, apart from quantificational BE, the only full (as against auxiliary) verb in the sentence; (ii) no (other) logical predicate features in the sentence; (iii) no name or other sub-sentential referring expression features in the sentence; (iv) the sentence contains a quantifier that is not an occurrence of EXIST. Colin McGinn and Rod Girle have alleged that standard (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  13. A general tableau method for propositional interval temporal logics: Theory and implementation.V. Goranko, A. Montanari, P. Sala & G. Sciavicco - 2006 - Journal of Applied Logic 4 (3):305-330.
    In this paper we focus our attention on tableau methods for propositional interval temporal logics. These logics provide a natural framework for representing and reasoning about temporal properties in several areas of computer science. However, while various tableau methods have been developed for linear and branching time point-based temporal logics, not much work has been done on tableau methods for interval-based ones. We develop a general tableau method for Venema's \cdt\ logic interpreted over partial orders (\nsbcdt\ for short). It (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  14. The accident of logical constants.Tristan Grøtvedt Haze - 2020 - Thought: A Journal of Philosophy 9 (1):34-42.
    Work on the nature and scope of formal logic has focused unduly on the distinction between logical and extra-logical vocabulary; which argument forms a logical theory countenances depends not only on its stock of logical terms, but also on its range of grammatical categories and modes of composition. Furthermore, there is a sense in which logical terms are unnecessary. Alexandra Zinke has recently pointed out that propositional logic can be done without logical terms. By defining a logical-term-free language (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  15. A theory of truth for a class of mathematical languages and an application.S. Heikkilä - manuscript
    In this paprer a class of so called mathematically acceptable (shortly MA) languages is introduced First-order formal languages containing natural numbers and numerals belong to that class. MA languages which are contained in a given fully interpreted MA language augmented by a monadic predicate are constructed. A mathematical theory of truth (shortly MTT) is formulated for some of these languages. MTT makes them fully interpreted MA languages which posses their own truth predicates, yielding consequences to philosophy of mathematics. (...)
    Download  
     
    Export citation  
     
    Bookmark  
  16. Filosofia Analitica e Filosofia Continentale.Sergio Cremaschi (ed.) - 1997 - 50018 Scandicci, Metropolitan City of Florence, Italy: La Nuova Italia.
    ● Sergio Cremaschi, The non-existing Island. I discuss the way in which the cleavage between the Continental and the Anglo-American philosophies originated, the (self-)images of both philosophical worlds, the converging rediscoveries from the Seventies, as well as recent ecumenic or anti-ecumenic strategies. I argue that pragmatism provides an important counter-instance to both the familiar self-images and to the fashionable ecumenic or anti-ecumenic strategies. My conclusions are: (i) the only place where Continental philosophy exists (as Euro-Communism one decade ago) is America; (...)
    Download  
     
    Export citation  
     
    Bookmark   9 citations  
  17. Not much higher-order vagueness in Williamson’s ’logic of clarity’.Nasim Mahoozi & Thomas Mormann - manuscript
    This paper deals with higher-order vagueness in Williamson's 'logic of clarity'. Its aim is to prove that for 'fixed margin models' (W,d,α ,[ ]) the notion of higher-order vagueness collapses to second-order vagueness. First, it is shown that fixed margin models can be reformulated in terms of similarity structures (W,~). The relation ~ is assumed to be reflexive and symmetric, but not necessarily transitive. Then, it is shown that the structures (W,~) come (...)
    Download  
     
    Export citation  
     
    Bookmark  
  18. A First-Order Logic Formalization of the Industrial Ontology Foundry Signature Using Basic Formal Ontology.Barry Smith, Farhad Ameri, Hyunmin Cheong, Dimitris Kiritsis, Dusan Sormaz, Chris Will & J. Neil Otte - 2019 - In Barry Smith, Farhad Ameri, Hyunmin Cheong, Dimitris Kiritsis, Dusan Sormaz, Chris Will & J. Neil Otte (eds.), ”, Proceedings of the Joint Ontology Workshops (JOWO), Graz.
    Basic Formal Ontology (BFO) is a top-level ontology used in hundreds of active projects in scientific and other domains. BFO has been selected to serve as top-level ontology in the Industrial Ontologies Foundry (IOF), an initiative to create a suite of ontologies to support digital manufacturing on the part of representatives from a number of branches of the advanced manufacturing industries. We here present a first draft set of axioms and definitions of an IOF upper ontology descending from BFO. (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  19. First-order swap structures semantics for some Logics of Formal Inconsistency.Marcelo E. Coniglio, Aldo Figallo-Orellano & Ana Claudia Golzio - 2020 - Journal of Logic and Computation 30 (6):1257-1290.
    The logics of formal inconsistency (LFIs, for short) are paraconsistent logics (that is, logics containing contradictory but non-trivial theories) having a consistency connective which allows to recover the ex falso quodlibet principle in a controlled way. The aim of this paper is considering a novel semantical approach to first-order LFIs based on Tarskian structures defined over swap structures, a special class of multialgebras. The proposed semantical framework generalizes previous aproaches to quantified LFIs presented in the literature. The case (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  20. Is Leibnizian calculus embeddable in first order logic?Piotr Błaszczyk, Vladimir Kanovei, Karin U. Katz, Mikhail G. Katz, Taras Kudryk, Thomas Mormann & David Sherry - 2017 - Foundations of Science 22 (4):73 - 88.
    To explore the extent of embeddability of Leibnizian infinitesimal calculus in first-order logic (FOL) and modern frameworks, we propose to set aside ontological issues and focus on pro- cedural questions. This would enable an account of Leibnizian procedures in a framework limited to FOL with a small number of additional ingredients such as the relation of infinite proximity. If, as we argue here, first order logic is indeed suitable for developing modern proxies for (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  21. The enduring scandal of deduction: is propositional logic really uninformative?Marcello D'Agostino & Luciano Floridi - 2009 - Synthese 167 (2):271-315.
    Deductive inference is usually regarded as being “tautological” or “analytical”: the information conveyed by the conclusion is contained in the information conveyed by the premises. This idea, however, clashes with the undecidability of first-order logic and with the (likely) intractability of Boolean logic. In this article, we address the problem both from the semantic and the proof-theoretical point of view. We propose a hierarchy of propositional logics that are all tractable (i.e. decidable in polynomial (...)
    Download  
     
    Export citation  
     
    Bookmark   26 citations  
  22. Logically Equivalent False Universal Propositions with Different Counterexample Sets.John Corcoran - 2007 - Bulletin of Symbolic Logic 11:554-5.
    This paper corrects a mistake I saw students make but I have yet to see in print. The mistake is thinking that logically equivalent propositions have the same counterexamples—always. Of course, it is often the case that logically equivalent propositions have the same counterexamples: “every number that is prime is odd” has the same counterexamples as “every number that is not odd is not prime”. The set of numbers satisfying “prime but not odd” is the same as the set of (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  23. The principle of wholistic reference/o princípio da referência universalista.John Corcoran - 2007 - Manuscrito 30 (2):493-505.
    In its strongest, unqualified form the principle of wholistic reference is that each and every proposition refers to the whole universe of discourse as such, regardless how limited the referents of its non-logical or content terms. Even though Boole changed from a monistic fixed-universe framework in his earlier works of 1847 and 1848 to a pluralistic multiple-universe framework in his mature treatise of 1854, he never wavered in his frank avowal of the principle of wholistic reference, possibly in a (...)
    Download  
     
    Export citation  
     
    Bookmark  
  24. Aristotle’s Syllogistic and Core Logic.Neil Tennant - 2014 - History and Philosophy of Logic 35 (2):120-147.
    I use the Corcoran–Smiley interpretation of Aristotle's syllogistic as my starting point for an examination of the syllogistic from the vantage point of modern proof theory. I aim to show that fresh logical insights are afforded by a proof-theoretically more systematic account of all four figures. First I regiment the syllogisms in the Gentzen–Prawitz system of natural deduction, using the universal and existential quantifiers of standard first-order logic, and the usual formalizations of Aristotle's sentence-forms. I explain (...)
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  25. Completeness of a first-order temporal logic with time-gaps.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - Theoretical Computer Science 160 (1-2):241-270.
    The first-order temporal logics with □ and ○ of time structures isomorphic to ω (discrete linear time) and trees of ω-segments (linear time with branching gaps) and some of its fragments are compared: the first is not recursively axiomatizable. For the second, a cut-free complete sequent calculus is given, and from this, a resolution system is derived by the method of Maslov.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  26. Elimination of Cuts in First-order Finite-valued Logics.Matthias Baaz, Christian G. Fermüller & Richard Zach - 1993 - Journal of Information Processing and Cybernetics EIK 29 (6):333-355.
    A uniform construction for sequent calculi for finite-valued first-order logics with distribution quantifiers is exhibited. Completeness, cut-elimination and midsequent theorems are established. As an application, an analog of Herbrand’s theorem for the four-valued knowledge-representation logic of Belnap and Ginsberg is presented. It is indicated how this theorem can be used for reasoning about knowledge bases with incomplete and inconsistent information.
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  27. Aftermath Of The Nothing.Laurent Dubois - 2017 - In J.-Y. Beziau, A. Costa-Leite & I. M. L. D’Ottaviano (eds.), CLE, v.81. pp. 93-124.
    This article consists in two parts that are complementary and autonomous at the same time. -/- In the first one, we develop some surprising consequences of the introduction of a new constant called Lambda in order to represent the object ``nothing" or ``void" into a standard set theory. On a conceptual level, it allows to see sets in a new light and to give a legitimacy to the empty set. On a technical level, it leads to a relative (...)
    Download  
     
    Export citation  
     
    Bookmark  
  28. Word Order and Incremental Update.Maria Bittner - 2003 - In Proceedings from CLS 39-1. CLS.
    The central claim of this paper is that surface-faithful word-by-word update is feasible and desirable, even in languages where word order is supposedly free. As a first step, in sections 1 and 2, I review an argument from Bittner 2001a that semantic composition is not a static process, as in PTQ, but rather a species of anaphoric bridging. But in that case the context-setting role of word order should extend from cross-sentential discourse anaphora to sentence-internal anaphoric composition. (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  29. Higher-order logic as metaphysics.Jeremy Goodman - 2024 - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press.
    This chapter offers an opinionated introduction to higher-order formal languages with an eye towards their applications in metaphysics. A simply relationally typed higher-order language is introduced in four stages: starting with first-order logic, adding first-order predicate abstraction, generalizing to higher-order predicate abstraction, and finally adding higher-order quantification. It is argued that both β-conversion and Universal Instantiation are valid on the intended interpretation of this language. Given these two principles, it (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  30. Validity and Soundness in the First Way.Graham Oppy - 2023 - Revista Portuguesa de Filosofia 79 (1-2):137-158.
    This article critically examines the structure and implications of the argument in ST 1, Q2, A3, associated with Aquinas’ First Way. Our central endeavor is to discern whether a certain disambiguation of point 6 (“There is something that is not moving/changing that moves/changes other things”) can be logically inferred from points 1-5. Through a three-part proof, the article establishes that under specific conditions, it can indeed be inferred. However, this interpretation notably diverges from Aquinas’ intended conclusion and (...)
    Download  
     
    Export citation  
     
    Bookmark  
  31. Completeness of a Hypersequent Calculus for Some First-order Gödel Logics with Delta.Matthias Baaz, Norbert Preining & Richard Zach - 2006 - In Baaz Matthias, Preining Norbert & Zach Richard (eds.), 36th Interna- tional Symposium on Multiple-valued Logic. May 2006, Singapore. Proceedings. IEEE Press.
    All first-order Gödel logics G_V with globalization operator based on truth value sets V C [0,1] where 0 and 1 lie in the perfect kernel of V are axiomatized by Ciabattoni’s hypersequent calculus HGIF.
    Download  
     
    Export citation  
     
    Bookmark  
  32. (4 other versions)The Fixation of Belief.C. S. Peirce - 1877 - Popular Science Monthly 12 (1):1-15.
    “Probably Peirce’s best-known works are the first two articles in a series of six that originally were collectively entitled Illustrations of the Logic of Science and published in Popular Science Monthly from November 1877 through August 1878. The first is entitled ‘The Fixation of Belief’ and the second is entitled ‘How to Make Our Ideas Clear.’ In the first of these papers Peirce defended, in a manner consistent with not accepting naive realism, the superiority of (...)
    Download  
     
    Export citation  
     
    Bookmark   297 citations  
  33. The principle of wholistic reference.John Corcoran - 2004 - Manuscrito 27 (1):159-171.
    In its strongest, unqualified form the principle of wholistic reference is that each and every proposition refers to the whole universe of discourse as such, regardless how limited the referents of its non-logical or content terms. Even though Boole changed from a monistic fixed-universe framework in his earlier works of 1847 and 1848 to a pluralistic multiple-universe framework in his mature treatise of 1854, he never wavered in his frank avowal of the principle of wholistic reference, possibly in a (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  34. A Modal Logic and Hyperintensional Semantics for Gödelian Intuition.David Elohim - manuscript
    This essay aims to provide a modal logic for rational intuition. Similarly to treatments of the property of knowledge in epistemic logic, I argue that rational intuition can be codified by a modal operator governed by the modal $\mu$-calculus. Via correspondence results between fixed point modal propositional logic and the bisimulation-invariant fragment of monadic second-order logic, a precise translation can then be provided between the notion of 'intuition-of', i.e., the cognitive phenomenal properties of thoughts, (...)
    Download  
     
    Export citation  
     
    Bookmark  
  35. First-order belief and paraconsistency.Srećko Kovač - 2009 - Logic and Logical Philosophy 18 (2):127-143.
    A first-order logic of belief with identity is proposed, primarily to give an account of possible de re contradictory beliefs, which sometimes occur as consequences of de dicto non-contradictory beliefs. A model has two separate, though interconnected domains: the domain of objects and the domain of appearances. The satisfaction of atomic formulas is defined by a particular S-accessibility relation between worlds. Identity is non-classical, and is conceived as an equivalence relation having the classical identity relation as (...)
    Download  
     
    Export citation  
     
    Bookmark  
  36. Incompleteness of a first-order Gödel logic and some temporal logics of programs.Matthias Baaz, Alexander Leitsch & Richard Zach - 1996 - In Kleine Büning Hans (ed.), Computer Science Logic. CSL 1995. Selected Papers. Springer. pp. 1--15.
    It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  37. First- and second-order logic of mass terms.Peter Roeper - 2004 - Journal of Philosophical Logic 33 (3):261-297.
    Provided here is an account, both syntactic and semantic, of first-order and monadic second-order quantification theory for domains that may be non-atomic. Although the rules of inference largely parallel those of classical logic, there are important differences in connection with the identification of argument places and the significance of the identity relation.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  38. A First-Order Modal Theodicy: God, Evil, and Religious Determinism.Gesiel Borges da Silva & Fábio Bertato - 2019 - South American Journal of Logic 5 (1):49-80.
    Edward Nieznanski developed in 2007 and 2008 two different systems in formal logic which deal with the problem of evil. Particularly, his aim is to refute a version of the logical problem of evil associated with a form of religious determinism. In this paper, we revisit his first system to give a more suitable form to it, reformulating it in first-order modal logic. The new resulting system, called N1, has much of the original (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  39.  77
    Epistemic logic with partial grasp.Francisca Silva - 2024 - Synthese 204 (92):1-27.
    We have to gain from recognizing a relation between epistemic agents and the parts of subject matters that play a role in their cognitive lives. I call this relation “grasping”. Namely, I zone in on one notion of having a partial grasp of a subject matter—that of agents grasping part of the subject matter that they are attending to—and characterize it. I propose that giving up the idealization that we fully grasp the subject matters we attend to allows one to (...)
    Download  
     
    Export citation  
     
    Bookmark  
  40. Refining Labelled Systems for Modal and Constructive Logics with Applications.Tim Lyon - 2021 - Dissertation, Technischen Universität Wien
    This thesis introduces the "method of structural refinement", which serves as a means of transforming the relational semantics of a modal and/or constructive logic into an 'economical' proof system by connecting two proof-theoretic paradigms: labelled and nested sequent calculi. The formalism of labelled sequents has been successful in that cut-free calculi in possession of desirable proof-theoretic properties can be automatically generated for large classes of logics. Despite these qualities, labelled systems make use of a complicated syntax that explicitly incorporates (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  41. On the notion of validity for the bilateral classical logic.Ukyo Suzuki & Yoriyuki Yamagata - manuscript
    This paper considers Rumfitt’s bilateral classical logic (BCL), which is proposed to counter Dummett’s challenge to classical logic. First, agreeing with several authors, we argue that Rumfitt’s notion of harmony, used to justify logical rules by a purely proof theoretical manner, is not sufficient to justify coordination rules in BCL purely proof-theoretically. For the central part of this paper, we propose a notion of proof-theoretical validity similar to Prawitz for BCL and proves that BCL is sound (...)
    Download  
     
    Export citation  
     
    Bookmark  
  42.  68
    Duality and Infinity.Guillaume Massas - 2024 - Dissertation, University of California, Berkeley
    Many results in logic and mathematics rely on techniques that allow for concrete, often visual, representations of abstract concepts. A primary example of this phenomenon in logic is the distinction between syntax and semantics, itself an example of the more general duality in mathematics between algebra and geometry. Such representations, however, often rely on the existence of certain maximal objects having particular properties such as points, possible worlds or Tarskian first-order structures. -/- This dissertation explores (...)
    Download  
     
    Export citation  
     
    Bookmark  
  43. The Normalization Theorem for the First-Order Classical Natural Deduction with Disjunctive Syllogism.Seungrak Choi - 2021 - Korean Journal of Logic 2 (24):143-168.
    In the present paper, we prove the normalization theorem and the consistency of the first-order classical logic with disjunctive syllogism. First, we propose the natural deduction system SCD for classical propositional logic having rules for conjunction, implication, negation, and disjunction. The rules for disjunctive syllogism are regarded as the rules for disjunction. After we prove the normalization theorem and the consistency of SCD, we extend SCD to the system SPCD for the first-order (...)
    Download  
     
    Export citation  
     
    Bookmark  
  44. Pure Logic and Higher-order Metaphysics.Christopher Menzel - 2024 - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press.
    W. V. Quine famously defended two theses that have fallen rather dramatically out of fashion. The first is that intensions are “creatures of darkness” that ultimately have no place in respectable philosophical circles, owing primarily to their lack of rigorous identity conditions. However, although he was thoroughly familiar with Carnap’s foundational studies in what would become known as possible world semantics, it likely wouldn’t yet have been apparent to Quine that he was fighting a losing battle against intensions, (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  45. starting rational reconstruction of Spinoza's metaphysics by "a formal analogy to elements of 'de deo' (E1)".Friedrich Wilhelm Grafe - 2020 - Archive.Org.
    We aim to compile some means for a rational reconstruction of a named part of the start-over of Baruch (Benedictus) de Spinoza's metaphysics in 'de deo' (which is 'pars prima' of the 'ethica, ordine geometrico demonstrata' ) in terms of 1st order model theory. In so far, as our approach will be judged successful, it may, besides providing some help in understanding Spinoza, also contribute to the discussion of some or other philosophical evergreen, e.g. 'ontological commitment'. For this text (...)
    Download  
     
    Export citation  
     
    Bookmark  
  46. A Case For Higher-Order Metaphysics.Andrew Bacon - 2024 - In Peter Fritz & Nicholas K. Jones (eds.), Higher-Order Metaphysics. Oxford University Press.
    Higher-order logic augments first-order logic with devices that let us generalize into grammatical positions other than that of a singular term. Some recent metaphysicians have advocated for using these devices to raise and answer questions that bear on many traditional issues in philosophy. In contrast to these 'higher-order metaphysicians', traditional metaphysics has often focused on parallel, but importantly different, questions concerning special sorts of abstract objects: propositions, properties and relations. The answers to the (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  47. Against a priori knowledge of non-trivial truths.Carin Robinson - 2014 - Dissertation, University of Kwazulu-Natal
    This is a thesis in support of the conceptual yoking of analytic truth to a priori knowledge. My approach is a semantic one; the primary subject matter throughout the thesis is linguistic objects, such as propositions or sentences. I evaluate arguments, and also forward my own, about how such linguistic objects’ truth is determined, how their meaning is fixed and how we, respectively, know the conditions under which their truth and meaning are obtained. The strategy is to make explicit (...)
    Download  
     
    Export citation  
     
    Bookmark  
  48. Natural Deduction for Modal Logic with a Backtracking Operator.Jonathan Payne - 2015 - Journal of Philosophical Logic 44 (3):237-258.
    Harold Hodes in [1] introduces an extension of first-order modal logic featuring a backtracking operator, and provides a possible worlds semantics, according to which the operator is a kind of device for ‘world travel’; he does not provide a proof theory. In this paper, I provide a natural deduction system for modal logic featuring this operator, and argue that the system can be motivated in terms of a reading of the backtracking operator whereby it serves to (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  49. On the Logics with Propositional Quantifiers Extending S5Π.Yifeng Ding - 2018 - In Guram Bezhanishvili, Giovanna D'Agostino, George Metcalfe & Thomas Studer (eds.), Advances in Modal Logic 12, proceedings of the 12th conference on "Advances in Modal Logic," held in Bern, Switzerland, August 27-31, 2018. pp. 219-235.
    Scroggs's theorem on the extensions of S5 is an early landmark in the modern mathematical studies of modal logics. From it, we know that the lattice of normal extensions of S5 is isomorphic to the inverse order of the natural numbers with infinity and that all extensions of S5 are in fact normal. In this paper, we consider extending Scroggs's theorem to modal logics with propositional quantifiers governed by the axioms and rules analogous to the usual ones (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  50. Constructing formal semantics from an ontological perspective. The case of second-order logics.Thibaut Giraud - 2014 - Synthese 191 (10):2115-2145.
    In a first part, I defend that formal semantics can be used as a guide to ontological commitment. Thus, if one endorses an ontological view \(O\) and wants to interpret a formal language \(L\) , a thorough understanding of the relation between semantics and ontology will help us to construct a semantics for \(L\) in such a way that its ontological commitment will be in perfect accordance with \(O\) . Basically, that is what I call constructing formal semantics (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
1 — 50 / 931