Sciweavers

100 search results - page 1 / 20
» A Schemata Calculus for Propositional Logic
Sort
View
79
Voted
TABLEAUX
2009
Springer
15 years 4 months ago
A Schemata Calculus for Propositional Logic
We define a notion of formula schema handling arithmetic parameters, indexed propositional variables (e.g. Pi) and iterated conjunctions/disjunctions (e.g. Vn i=1 Pi, where n is a...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
89
Voted
JAIR
2011
166views more  JAIR 2011»
14 years 5 months ago
Decidability and Undecidability Results for Propositional Schemata
We define a logic of propositional formula schemata adding to the syntax of propositional logic indexed propositions (e.g., pi) and iterated connectives ∨ or ∧ ranging over i...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
88
Voted
AML
2006
106views more  AML 2006»
14 years 10 months ago
Upper bounds on complexity of Frege proofs with limited use of certain schemata
The paper considers a commonly used axiomatization of the classical propositional logic and studies how different axiom schemata in this system contribute to proof complexity of th...
Pavel Naumov
92
Voted
LATA
2010
Springer
15 years 7 months ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
113
Voted
ICFP
2012
ACM
13 years 18 days ago
Propositions as sessions
Continuing a line of work by Abramsky (1994), by Bellin and Scott (1994), and by Caires and Pfenning (2010), among others, this paper presents CP, a calculus in which propositions...
Philip Wadler