Results 21 to 30 of about 170,706 (312)
A Proof Tree Builder for Sequent Calculus and Hoare Logic [PDF]
We have developed a web-based pedagogical proof assistant, the Proof Tree Builder, that lets you apply rules upwards from the initial goal in sequent calculus and Hoare logic for a simple imperative language.
Joomy Korkut
semanticscholar +1 more source
SeCaV: A Sequent Calculus Verifier in Isabelle/HOL [PDF]
We describe SeCaV, a sequent calculus verifier for first-order logic in Isabelle/HOL, and the SeCaV Unshortener, an online tool that expands succinct derivations into the full SeCaV syntax. We leverage the power of Isabelle/HOL as a proof checker for our
Asta Halkjær From +2 more
semanticscholar +1 more source
Sequent Calculus in the Topos of Trees
Nakano's "later" modality, inspired by G\"{o}del-L\"{o}b provability logic, has been applied in type systems and program logics to capture guarded recursion. Birkedal et al modelled this modality via the internal logic of the topos of trees. We show that
A. Bizjak +13 more
core +2 more sources
Cut-free Sequent Calculus and Natural Deduction for the Tetravalent Modal Logic [PDF]
The tetravalent modal logic (TML\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin ...
M. Figallo
semanticscholar +1 more source
A proof-theoretic study of bi-intuitionistic propositional sequent calculus
Luís Pinto, Tarmo Uustalu
openalex +3 more sources
Superdeduction in Lambda-Bar-Mu-Mu-Tilde [PDF]
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
Curry-Howard for Sequent Calculus at Last!
José Espírito Santo
openalex +3 more sources
Restrictions for loop-check in sequent calculus for temporal logic with until operator
In this paper, we present sequent calculus for branching-time temporal logic with until operator. This sequent calculus uses efficient loop-checktechinque.
Adomas Birštunas
doaj +1 more source
Canonical Proof nets for Classical Logic [PDF]
Proof nets provide abstract counterparts to sequent proofs modulo rule permutations; the idea being that if two proofs have the same underlying proof-net, they are in essence the same proof.
McKinley, Richard
core +2 more sources
Sequent calculus for propositional likelihood logic
There is not abstract.
Romas Alonderis
doaj +3 more sources

