Results 1 to 10 of about 27,151 (281)
The Computational Complexity of Propositional Cirquent Calculus [PDF]
Logical Methods in Computer Science, 2015 Introduced in 2006 by Japaridze, cirquent calculus is a refinement of sequent calculus. The advent of cirquent calculus arose from the need for a deductive system with a more explicit ability to reason about resources.
Matthew Steven Bauer
doaj +4 more sources
Relativized Propositional Calculus [PDF]
, 2012 Proof systems for the Relativized Propositional Calculus are defined and compared.
Cook, Stephen
openaire +3 more sources
Propositional calculus and binary calculus
Uniciencia, 1990 No ...
Osvaldo Skliar, Víctor Medina
doaj +2 more sources
Sequent calculus for propositional likelihood logic
Lietuvos Matematikos Rinkinys, 2023 There is not abstract.
Romas Alonderis
doaj +3 more sources
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
Logical Methods in Computer Science, 2022 We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +3 more
doaj +1 more source
Schema Complexity in Propositional-Based Logics
Mathematics, 2021 The essential structure of derivations is used as a tool for measuring the complexity of schema consequences in propositional-based logics. Our schema derivations allow the use of schema lemmas and this is reflected on the schema complexity.
Jaime Ramos +2 more
doaj +1 more source
On Deriving Nested Calculi for Intuitionistic Logics from Semantic Systems [PDF]
, 2020 This paper shows how to derive nested calculi from labelled calculi for propositional intuitionistic logic and first-order intuitionistic logic with constant domains, thus connecting the general results for labelled calculi with the more refined ...
A Ciabattoni +17 more
core +2 more sources
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
Axioms, 2020 In this paper, we consider some paraconsistent calculi in a Hilbert-style formulation with the rule of detachment as the sole rule of interference.
Janusz Ciuciura
doaj +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