Results 1 to 10 of about 27,177 (320)
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 +5 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
Propositional Calculus and Realizability [PDF]
Transactions of the American Mathematical Society, 1953 Gene F. Rose
+6 more sources
Propositional calculus and binary calculus
Uniciencia, 1990 No ...
Osvaldo Skliar, Víctor Medina
doaj +2 more sources
The higher dimensional propositional calculus
Logic Journal of the IGPLAbstract In recent research, some of the present authors introduced the concept of an $n$-dimensional Boolean algebra and its corresponding propositional logic $n\textrm{CL}$, generalizing the Boolean propositional calculus to $n\geq 2$ perfectly symmetric truth values.
Bucciarelli, A +4 more
openaire +6 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
Note on duality in propositional calculus. [PDF]
Notre Dame Journal of Formal Logic, 1968 Works, Chandler, Yourgrau, Wolfgang
openaire +5 more sources
An algebra related with a propositional calculus
Proceedings of the Japan Academy, Series A, Mathematical Sciences, 1966 Kiyoshi Iséki
openaire +4 more sources
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