Results 21 to 30 of about 4,158,085 (300)
Natural Language Deduction through Search over Statement Compositions [PDF]
Conference on Empirical Methods in Natural Language Processing, 2022 In settings from fact-checking to question answering, we frequently want to know whether a collection of evidence (premises) entails a hypothesis. Existing methods primarily focus on the end-to-end discriminative version of this task, but less work has ...
Kaj Bostrom +3 more
semanticscholar +1 more source
A Classification of Improper Inference Rules
Bulletin of the Section of Logic, 2022 In the natural deduction system for classical propositional logic given by G. Gentzen, there are some inference rules with assumptions discharged by the rule. D. Prawitz calls such inference rules improper as opposed to proper ones.
Katsumi Sasaki
doaj +1 more source
Natural Deduction Calculi and Sequent Calculi for Counterfactual Logics
Studia Logica: An International Journal for Symbolic Logic, 2016 Francesca Poggiolesi
openalex +3 more sources
Studia Logica: An International Journal for Symbolic Logic, 2021 In a previous paper (of which this is a prosecution) we investigated the extraction of proof-theoretic properties of natural deduction derivations from their impredicative translation into System F.
Paolo Pistone +2 more
semanticscholar +1 more source
A Sequent Systems without Improper Derivations
Bulletin of the Section of Logic, 2022 In the natural deduction system for classical propositional logic given by G. Gentzen, there are some inference rules with assumptions discharged by the rule. D. Prawitz calls such inference rules improper, and others proper. Improper inference rules are
Katsumi Sasaki
doaj +1 more source
Between Thinking and Acting Fichte’s Deduction of the Concept of Right [PDF]
Manuscrito, 2023 Fichte’s ambitious project in the Foundations of Natural Right is to provide an a priori deduction of the concept of right independently from morality.
Laurenz Ramsauer
doaj +1 more source
Proof Compression and NP Versus PSPACE II
Bulletin of the Section of Logic, 2020 We upgrade [3] to a complete proof of the conjecture NP = PSPACE that is known as one of the fundamental open problems in the mathematical theory of computational complexity; this proof is based on [2].
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
Proof Compression and NP Versus PSPACE II: Addendum
Bulletin of the Section of Logic, 2022 In our previous work we proved the conjecture NP = PSPACE by advanced proof theoretic methods that combined Hudelmaier’s cut-free sequent calculus for minimal logic (HSC) with the horizontal compressing in the corresponding minimal Prawitz-style natural ...
Lew Gordeev, Edward Hermann Haeusler
doaj +1 more source
A Proof Theoretic Analysis of Intruder Theories [PDF]
Logical Methods in Computer Science, 2010 We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages Gamma under the theory of blind signatures and arbitrary convergent equational theories modulo ...
Alwen F Tiu, Rajeev Gore, Jeremy Dawson
doaj +1 more source
A note on strong normalization in classical natural deduction [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 In the context of natural deduction for propositional classical logic, with classicality given by the inference rule reductio ad absurdum, we investigate the De Morgan translation of disjunction in terms of negation and conjunction.
José Espírito Santo
doaj +1 more source