Results 21 to 30 of about 2,868 (293)

Two loop detection mechanisms: a comparison [PDF]

, 1997
In order to compare two loop detection mechanisms we describe two calculi for theorem proving in intuitionistic propositional logic. We call them both MJ Hist, and distinguish between them by description as `Swiss' or `Scottish'. These calculi combine in
Howe, J. M., Howe, Jacob M., Jacob Howe, Jacob M. Howe   +3 more
core   +1 more source

Sequent calculus for propositional likelihood logic

Lietuvos Matematikos Rinkinys, 2023
There is not abstract.
Romas Alonderis
doaj   +3 more sources

Multi-succedent sequent calculus for intuitionistic epistemic logic

Lietuvos Matematikos Rinkinys
A multi-succedent sequent calculus for intuitionistic epistemic logic (IEL) is introduced in the paper. It is  proved that the structural rules of weakening and contraction and the rule of cut are admissible in the  calculus.
Romas Alonderis
doaj   +3 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   +1 more source

Labeled Sequent Calculus for Orthologic [PDF]

, 2018
Orthologic (OL) is non-classical logic and has been studied as a part of quantumlogic. OL is based on an ortholattice and is also called minimal quantum logic.Sequent calculus is used as a tool for proof in logic and has been examinedfor several decades.
Kawano, Tomoaki
core   +1 more source

Brodsky’s coding method for propositional logic

Lietuvos Matematikos Rinkinys, 2017
Brodsky’s coding method for propositional logic is considered in the paper. Based on the sequent calculus, the method allows us to determine whether an arbitrary sequent is derivable in the calculus without constructing proof-search trees.
Romas Alonderis
doaj   +1 more source

Proof-search of propositional intuitionistic logic sequents by means of classical logic calculus

Lietuvos Matematikos Rinkinys, 2008
In the paper, we define some classes of sequents of the propositional intuitionistic logic. These are classes of primarily and α-primarily reducible sequents. Then we show how derivability of these sequents in a propositional intuitionistic logic sequent
Romas Alonderis
doaj   +1 more source

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   +3 more sources

A derivation-loop method for temporal logic

Lietuvos Matematikos Rinkinys, 2019
Various types of calculi (Hilbert, Gentzen sequent, resolution calculi, tableaux) for propositional linear temporal logic (PLTL) have been considered in the literature.
Romas Alonderis, Haroldas Giedra
doaj   +1 more source

Sequent Calculus in the Topos of Trees [PDF]

, 2015
Extended version, with full proof details, of a paper accepted to FoSSaCS 2015 (this version edited to fix some minor typos)
Clouston, Ranald, Gore, Rajeev
openaire   +4 more sources