Results 41 to 50 of about 165,990,627 (290)
Mathematics, 2023 The increasing significance of theorem proving-based formalization in mathematics and computer science highlights the necessity for formalizing foundational mathematical theories. In this work, we employ the Coq interactive theorem prover to methodically
Dakai Guo, Wensheng Yu
doaj +1 more source
Weak topologies for Linear Logic [PDF]
Logical Methods in Computer Science, 2016 We construct a denotational model of linear logic, whose objects are all the locally convex and separated topological vector spaces endowed with their weak topology.
Marie Kerjean
doaj +1 more source
Annals of Pure and Applied Logic, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Proof search in Lax Logic [PDF]
Mathematical Structures in Computer Science, 2001 The author gives two proof-search calculi for so-called lax logic. The first calculus is useful for enumerating without redundancy all proofs in the logic; especially where proof-search is for natural deductions. The other calculus builds on the propositional fragment of the first calculus to give a decision procedure for propositional lax logic, so ...
openaire +4 more sources
The Sequent Calculus Trainer with Automated Reasoning - Helping Students to Find Proofs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 The sequent calculus is a formalism for proving validity of statements formulated in First-Order Logic. It is routinely used in computer science modules on mathematical logic.
Arno Ehle +2 more
doaj +1 more source
Circuitree: A Datalog Reasoner in Zero-Knowledge
IEEE Access, 2022 Driven by the increased consciousness in data ownership and privacy, zero-knowledge proofs (ZKPs) have become a popular tool to convince a third party of the truthfulness of a statement without disclosing any further information.
Tom Godden +5 more
doaj +1 more source
The Completeness of Propositional Resolution: A Simple and Constructive Proof [PDF]
Logical Methods in Computer Science, 2006 It is well known that the resolution method (for propositional logic) is complete. However, completeness proofs found in the literature use an argument by contradiction showing that if a set of clauses is unsatisfiable, then it must have a resolution ...
Jean Gallier
doaj +1 more source
On Correspondence between Selective CPS Transformation and Selective Double Negation Translation
Mathematics, 2021 A double negation translation (DNT) embeds classical logic into intuitionistic logic. Such translations correspond to continuation passing style (CPS) transformations in programming languages via the Curry-Howard isomorphism.
Hyeonseung Im
doaj +1 more source
On the relative proof complexity of deep inference via atomic flows [PDF]
Logical Methods in Computer Science, 2015 We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore ...
Anupam Das
doaj +1 more source
The logic of proofs, semantically
Annals of Pure and Applied Logic, 2005 Artemov introduced the logic of proofs, called LP, and established its arithmetical provability completeness as well as the realization of modal logic S4 in LP, which answers a long-standing question about the provability semantics for S4, posed by Gödel, and hence for intuitionistic propositional logic.
openaire +1 more source