Results 11 to 20 of about 165,990,627 (290)
The basic intuitionistic logic of proofs [PDF]
Journal of Symbolic Logic, 2007 AbstractThe language of the basic logic of proofs extends the usual propositional language by forming sentences of the sort x is a proof of F for any sentence F. In this paper a complete axiomatization for the basic logic of proofs in Heyting Arithmetic HA was found.
Artemov, Sergei, Iemhoff, Rosalie
openaire +7 more sources
Amortised resource analysis with separation logic [PDF]
, 2011 Type-based amortised resource analysis following Hofmann and Jost—where resources are associated with individual elements of data structures and doled out to the programmer under a linear typing discipline—have been successful in providing concrete ...
Atkey, Robert
core +4 more sources
Automatic Function Annotations for Hoare Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 In systems verification we are often concerned with multiple, inter-dependent properties that a program must satisfy. To prove that a program satisfies a given property, the correctness of intermediate states of the program must be characterized. However,
Daniel Matichuk
doaj +1 more source
Semi-Automation of Meta-Theoretic Proofs in Beluga
Electronic Proceedings in Theoretical Computer Science, 2023 We present a sound and complete focusing calculus for the core of the logic behind the proof assistant Beluga as well as an overview of its implementation as a tactic in Beluga's interactive proof environment Harpoon. The focusing calculus is designed to
Schwartzentruber, Johanna +1 more
doaj +1 more source
A new graphical calculus of proofs [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 We offer a simple graphical representation for proofs of intuitionistic logic, which is inspired by proof nets and interaction nets (two formalisms originating in linear logic).
Sandra Alves +2 more
doaj +1 more source
Certification of Prefixed Tableau Proofs for Modal Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Different theorem provers tend to produce proof objects in different formats and this is especially the case for modal logics, where several deductive formalisms (and provers based on them) have been presented.
Tomer Libal, Marco Volpe
doaj +1 more source
On the meaning of logical completeness [PDF]
Logical Methods in Computer Science, 2010 Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs.
Michele Basaldella, Kazushige Terui
doaj +1 more source
Is Mathematical Logic Really Necessary in Teaching Mathematical Proofs? [PDF]
Athens Journal of Education, 2020 As it is already observed by mathematicians and educators, there is a discrepancy between the formal techniques of mathematical logic and the informal techniques of mathematics in regards to proof.
Michael Aristidou
doaj +1 more source
Quasipolynomial Normalisation in Deep Inference via Atomic Flows and Threshold Formulae [PDF]
Logical Methods in Computer Science, 2016 Je\v{r}\'abek showed that cuts in classical propositional logic proofs in deep inference can be eliminated in quasipolynomial time. The proof is indirect and it relies on a result of Atserias, Galesi and Pudl\'ak about monotone sequent calculus and a ...
Paola Bruscoli +3 more
doaj +1 more source
Cut Elimination in Multifocused Linear Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We study cut elimination for a multifocused variant of full linear logic in the sequent calculus. The multifocused normal form of proofs yields problems that do not appear in a standard focused system, related to the constraints in grouping rule ...
Taus Brock-Nannestad, Nicolas Guenot
doaj +1 more source