Results 31 to 40 of about 170,956 (278)

Sequent calculus for propositional likelihood logic

open access: yesLietuvos Matematikos Rinkinys, 2023
There is not abstract.
Romas Alonderis
doaj   +3 more sources

Uniform Proofs of Normalisation and Approximation for Intersection Types [PDF]

open access: yesElectronic 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

A Cut-Free Sequent Calculus for Defeasible Erotetic Inferences [PDF]

open access: yesStudia Logica: An International Journal for Symbolic Logic, 2018
In recent years, the effort to formalize erotetic inferences—i.e., inferences to and from questions—has become a central concern for those working in erotetic logic. However, few have sought to formulate a proof theory for these inferences.
Jared Millson
semanticscholar   +1 more source

Integrating a Global Induction Mechanism into a Sequent Calculus [PDF]

open access: yesInternational Conference on Theorem Proving with Analytic Tableaux and Related Methods, 2017
Most interesting proofs in mathematics contain an inductive argument which requires an extension of the LK-calculus to formalize. The most commonly used calculi contain a separate rule or axiom which reduces the important proof theoretic properties of ...
David M. Cerna, Michael Peter Lettmann
semanticscholar   +1 more source

Brodsky’s coding method for propositional logic

open access: yesLietuvos 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

Sequent calculus usage for BDI agent implementation

open access: yesLietuvos 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

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

open access: yesLietuvos 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

A derivation-loop method for temporal logic

open access: yesLietuvos 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

Verifying a Sequent Calculus Prover for First-Order Logic with Functions in Isabelle/HOL

open access: yesJournal of automated reasoning
We describe the design, implementation and verification of an automated theorem prover for first-order logic with functions. The proof search procedure is based on sequent calculus and we formally verify its soundness and completeness in Isabelle/HOL ...
Asta Halkjær From   +1 more
semanticscholar   +1 more source

Efficient loop-check for multimodal KD45n logic

open access: yesLietuvos Matematikos Rinkinys, 2021
We introduce sequent calculus for multi-modal logic KD45n which uses efficient loop-check. Efficiency of the used loop-check is obtained by using marked modal operator squarei which is used as an alternative to sequent with histories ([2,3]).We use ...
Adomas Birštunas
doaj   +1 more source

Home - About - Disclaimer - Privacy