Result 1 to 20 of 489 total
Kripke semantics and proof systems for combining intuitionistic logic and classical logic. (English)
Ann. Pure Appl. Logic 164, No. 2, 86-111 (2013).
1
Realization theorem for epistemic logic with justification. (English)
Proc. Jangjeon Math. Soc. 15, No. 1, 47-52 (2012).
2
A systematic approach to canonicity in the classical sequent calculus. (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, 183-197, electronic only (2012).
3
Sequent calculus for the intersection of LK and the reversed. (English)
Far East J. Math. Sci. (FJMS) 68, No. 2, 297-305 (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
Playing hybrid games with keymaera. (English)
Gramlich, Bernhard (ed.) et al., Automated reasoning. 6th international joint conference, IJCAR 2012, Manchester, UK, June 26‒29, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31364-6/pbk). Lecture Notes in Computer Science 7364. Lecture Notes in Artificial Intelligence, 439-453 (2012).
7
Reasoning about time-dependent multi-agents: foundations of theorem proving and model checking. (English)
Nguyen, Ngoc Thanh (ed.), Transactions on Computational Collective Intelligence VI. Berlin: Springer (ISBN 978-3-642-29355-9/pbk). Lecture Notes in Computer Science 7190. Journal Subline, 181-201 (2012).
8
Classical call-by-need sequent calculi: the unity of semantic artifacts. (English)
Schrijvers, Tom (ed.) et al., Functional and logic programming. 11th international symposium, FLOPS 2012, Kobe, Japan, May 23‒25, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29821-9/pbk). Lecture Notes in Computer Science 7294, 32-46 (2012).
9
Untyping typed algebras and colouring cyclic linear logic. (English)
Log. Methods Comput. Sci. 8, No. 2, Paper No. 13, 21 p., electronic only (2012).
10
Proofs with monotone cuts. (English)
Math. Log. Q. 58, No. 3, 177-187 (2012).
11
Conservativity for logics of justified belief: two approaches. (English)
Ann. Pure Appl. Logic 163, No. 7, 809-819 (2012).
12
Bounded linear-time temporal logic: a proof-theoretic investigation. (English)
Ann. Pure Appl. Logic 163, No. 4, 439-466 (2012).
13
Proof analysis in intermediate logics. (English)
Arch. Math. Logic 51, No. 1-2, 71-92 (2012).
14
An interpolating sequent calculus for quantifier-free Presburger arithmetic. (English)
J. Autom. Reasoning 47, No. 4, 341-367 (2011).
15
DEL-sequents for progression. (English)
J. Appl. Non-Class. Log. 21, No. 3-4, 289-321 (2011).
16
Characterization of quantum states in predicative logic. (English)
Int. J. Theor. Phys. 50, No. 12, 3669-3681 (2011).
17
A modal logic internalizing normal proofs. (English)
Inf. Comput. 209, No. 12, 1519-1535 (2011).
18
Constructive linear-time temporal logic: proof systems and Kripke semantics. (English)
Inf. Comput. 209, No. 12, 1491-1503 (2011).
19
Cut-free Gentzen calculus for multimodal CK. (English)
Inf. Comput. 209, No. 12, 1465-1490 (2011).
20
Result 1 to 20 of 489 total
Start
Contact
Print
General Help
