Results 1 to 10 of about 15,159 (278)
Sequent Calculus and Equational Programming [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 Proof assistants and programming languages based on type theories usually come in two flavours: one is based on the standard natural deduction presentation of type theory and involves eliminators, while the other provides a syntax in equational style. We
Nicolas Guenot, Daniel Gustafsson
doaj +6 more sources
On noncommutative extensions of linear logic [PDF]
Logical Methods in Computer Science, 2019 Pomset logic introduced by Retor\'e is an extension of linear logic with a self-dual noncommutative connective. The logic is defined by means of proof-nets, rather than a sequent calculus.
Sergey Slavnov
doaj +3 more sources
Sequent calculus usage for BDI agent implementation
Lietuvos Matematikos Rinkinys, 2023 BDI logic is widely used to describe agent based systems, since it can express a lot of different real world domains with three main operators: belief, desire and intention.
Adomas Birstunas
doaj +5 more sources
Uniform Proofs of Normalisation and Approximation for Intersection Types [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 We present intersection type systems in the style of sequent calculus, modifying the systems that Valentini introduced to prove normalisation properties without using the reducibility method.
Kentaro Kikuchi
doaj +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 +4 more sources
A labeled sequent calculus for propositional linear time logic
Lietuvos Matematikos Rinkinys, 2012 A labeled sequent calculus LSC for propositional linear discrete time logic PLTL is introduced. Its sub-calculus LSC−TL is proved to be complete for some class of PLTL sequents.
Romas Alonderis
doaj +2 more sources
Inducing syntactic cut-elimination for indexed nested sequents [PDF]
Logical Methods in Computer Science, 2018 The key to the proof-theoretic study of a logic is a proof calculus with a subformula property. Many different proof formalisms have been introduced (e.g. sequent, nested sequent, labelled sequent formalisms) in order to provide such calculi for the many
Revantha Ramanayake
doaj +3 more sources
A Focused Sequent Calculus Framework for Proof Search in Pure Type Systems [PDF]
Logical Methods in Computer Science, 2011 Basic proof-search tactics in logic and type theory can be seen as the root-first applications of rules in an appropriate sequent calculus, preferably without the redundancies generated by permutation of rules. This paper addresses the issues of defining
Stéphane Jean Eric Lengrand +2 more
doaj +2 more sources
A bisimulation between DPLL(T) and a proof-search strategy for the focused sequent calculus [PDF]
, 2013 International audienceWe describe how the Davis-Putnam-Logemann-Loveland proced- ure DPLL is bisimilar to the goal-directed proof-search mechanism described by a standard but carefully chosen sequent calculus.
Mahfuza Farooque +2 more
openalex +5 more sources
Fast Cut-Elimination using Proof Terms: An Empirical Study [PDF]
Electronic Proceedings in Theoretical Computer Science, 2018 Urban and Bierman introduced a calculus of proof terms for the sequent calculus LK with a strongly normalizing reduction relation. We extend this calculus to simply-typed higher-order logic with inferences for induction and equality, albeit without ...
Gabriel Ebner
doaj +4 more sources