Results 41 to 50 of about 32,356 (302)
Classical Proofs as Parallel Programs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 We introduce a first proofs-as-parallel-programs correspondence for classical logic. We define a parallel and more powerful extension of the simply typed lambda calculus corresponding to an analytic natural deduction based on the excluded middle law. The
Federico Aschieri +2 more
doaj +1 more source
A Graph Calculus for Predicate Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 We introduce a refutation graph calculus for classical first-order predicate logic, which is an extension of previous ones for binary relations. One reduces logical consequence to establishing that a constructed graph has empty extension, i. e.
Paulo A. S. Veloso, Sheila R. M. Veloso
doaj +1 more source
Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 Superdeduction is a method specially designed to ease the use of first-order theories in predicate logic. The theory is used to enrich the deduction system with new deduction rules in a systematic, correct and complete way.
Clément Houtmann
doaj +1 more source
Classical and fuzzy logic evaluation of students' master theses in Matlab Fuzzy Logic Toolbox software: Dealing with subjectivity in human reasoning [PDF]
Agroznanje, 2018 The two-level evaluation of defined objectives, presented materials and methods and interpretation of results in master theses was done, in order to estimate their scientific contribution and statistical relevance. First level of evaluation was performed
Hajder Đurađ, Mićić Nikola
doaj +1 more source
Geometrisation of first-order logic
, 2015 That every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor ...
Dyckhoff R. +3 more
core +1 more source
Tableau Systems for Epistemic Positional Logics
Bulletin of the Section of Logic, 2021 The goal of the article is twofold. The first one is to provide logics based on positional semantics which will be suitable for the analysis of epistemic modalities such as ‘agent ... knows/beliefs that ...’.
Mateusz Klonowski +2 more
doaj +1 more source
, 2020 The first sequent calculus, LK is the example after which many other calculi have been fashioned. We describe this calculus, prove its equivalence to the axiom system K, and provide a sound and complete interpretation too. A major part of Section 2.3 is a presentation of the proof of the cut theorem using triple induction.
openaire +2 more sources
Aristotelian logic and its perspectives
Pensamiento. Revista de Investigación e Información Filosófica, 2017 The legitimacy of Aristotelian logic was questioned in the twentieth century. As a result, the question of whether it should be replaced or restored remains unanswered.
Manuel Correia
doaj +1 more source
Classical System of Martin-Lof's Inductive Definitions is not Equivalent to Cyclic Proofs [PDF]
Logical Methods in Computer Science, 2019 A cyclic proof system, called CLKID-omega, gives us another way of representing inductive definitions and efficient proof search. The 2005 paper by Brotherston showed that the provability of CLKID-omega includes the provability of LKID, first order ...
Stefano Berardi, Makoto Tatsuta
doaj +1 more source
Logical Methods in Computer Science, 2013 We consider cut-elimination in the sequent calculus for classical first-order logic. It is well known that this system, in its most general form, is neither confluent nor strongly normalizing.
Stefan Hetzl, Lutz Straßburger
doaj +1 more source