Result 1 to 20 of 542 total
A simple proof that super-consistency implies cut elimination. (English)
Notre Dame J. Formal Logic 53, No. 4, 439-456 (2012).
1
The computational content of arithmetical proofs. (English)
Notre Dame J. Formal Logic 53, No. 3, 289-296 (2012).
2
Towards CERes in intuitionistic logic. (English)
Cégielski, Patrick (ed.) et al., Computer science logic (CSL’12). 26th international workshop, 21th annual conference of the EACSL, September 3‒6, 2012, Fontainebleau, France. Selected papers based on the presentations at the conference. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-42-2). LIPICS ‒ Leibniz International Proceedings in Informatics 16, 485-499, electronic only (2012).
3
Cut for core logic. (English)
Rev. Symb. Log. 5, No. 3, 450-479 (2012).
4
Cut elimination and realization for epistemic logics with justification. (English)
J. Log. Comput. 22, No. 5, 1171-1198 (2012).
5
Syntactic cut-elimination for a fragment of the modal mu-calculus. (English)
Ann. Pure Appl. Logic 163, No. 12, 1838-1853 (2012).
6
Interaction graphs: multiplicatives. (English)
Ann. Pure Appl. Logic 163, No. 12, 1808-1837 (2012).
7
Effective cut-elimination for a fragment of modal mu-calculus. (English)
Stud. Log. 100, No. 1-2, 279-287 (2012).
8
A cut-free sequent system for two-dimensional modal logic, and why it matters. (English)
Ann. Pure Appl. Logic 163, No. 11, 1611-1623 (2012).
9
Valentini’s cut-elimination for provability logic resolved. (English)
Rev. Symb. Log. 5, No. 2, 212-238 (2012).
10
Algebraic proof theory for substructural logics: cut-elimination and completions. (English)
Ann. Pure Appl. Logic 163, No. 3, 266-290 (2012).
11
Canonical signed calculi with multi-ary quantifiers. (English)
Ann. Pure Appl. Logic 163, No. 7, 951-960 (2012).
12
Proof theory of Nelson’s paraconsistent logic: a uniform perspective. (English)
Theor. Comput. Sci. 415, 1-38 (2012).
13
Non-commutative infinitary Peano arithmetic. (English)
Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12‒15, 2011. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPICS ‒ Leibniz International Proceedings in Informatics 12, 538‒552, electronic only (2011).
14
Soundness and principal contexts for a shallow polymorphic type system based on classical logic. (English)
Log. J. IGPL 19, No. 6, 848-896 (2011).
15
Constructive linear-time temporal logic: proof systems and Kripke semantics. (English)
Inf. Comput. 209, No. 12, 1491-1503 (2011).
16
Cut-free Gentzen calculus for multimodal CK. (English)
Inf. Comput. 209, No. 12, 1465-1490 (2011).
17
Sequent calculi and decidability for intuitionistic hybrid logic. (English)
Inf. Comput. 209, No. 12, 1447-1463 (2011).
18
Admissibility of cut in congruent modal logics. (English)
Log. Log. Philos. 20, No. 3, 189-203 (2011).
19
Sequent calculi for induction and infinite descent. (English)
J. Log. Comput. 21, No. 6, 1177-1216 (2011).
20
Result 1 to 20 of 542 total
Start
Contact
Print
General Help
