Result 1 to 20 of 985 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
Intuitionistic epistemic logic, Kripke models and Fitch’s paradox. (English)
J. Philos. Log. 41, No. 5, 877-900 (2012).
2
Extendible formulas in two variables in intuitionistic logic. (English)
Stud. Log. 100, No. 1-2, 61-89 (2012).
3
Delimited control operators prove double-negation shift. (English)
Ann. Pure Appl. Logic 163, No. 11, 1549-1559 (2012).
4
A graph calculus for proving intuitionistic relation algebraic equations. (English)
Cox, Philip (ed.) et al., Diagrammatic representation and inference. 7th international conference, Diagrams 2012, Canterbury, UK, July 2‒6, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-31222-9/pbk). Lecture Notes in Computer Science 7352. Lecture Notes in Artificial Intelligence, 324-326 (2012).
5
Semantics of structured normal logic programs. (English)
J. Log. Algebr. Program. 81, No. 5, 559-584 (2012).
6
Which classical correspondence is valid in intuitionistic modal logic? (English)
Log. J. IGPL 20, No. 1, 331-348 (2012).
7
Unification and projectivity in Fregean varieties. (English)
Log. J. IGPL 20, No. 1, 73-93 (2012).
8
The Gödel-Tarski translations of intuitionistic propositional formulas. (English)
Erdem, Esra (ed.) et al., Correct reasoning. Essays on logic-based AI in honour of Vladimir Lifschitz. Berlin: Springer (ISBN 978-3-642-30742-3/pbk). Lecture Notes in Computer Science 7265, 487-491 (2012).
9
Intuitionistic implication without disjunction. (English)
J. Log. Comput. 22, No. 3, 375-404 (2012).
10
On bounded functional interpretations. (English)
Ann. Pure Appl. Logic 163, No. 8, 1030-1049 (2012).
11
Intuitionistic implication makes model checking hard. (English)
Log. Methods Comput. Sci. 8, No. 2, Paper No. 3, 29 p., electronic only (2012).
12
Intuitionistic logic and Muchnik degrees. (English)
Algebra Univers. 67, No. 2, 175-188 (2012).
13
In the full propositional logic, 5/8 of classical tautologies are intuitionistically valid. (English)
Ann. Pure Appl. Logic 163, No. 7, 875-887 (2012).
14
Algebraic semantics for the $(\leftrightarrow, \neg \neg)$-fragment of IPC. (English)
Math. Log. Q. 58, No. 1-2, 29-37 (2012).
15
A constructive investigation of satisfiability. (English)
Ann. Pure Appl. Logic 163, No. 2, 111-121 (2012).
16
A hybrid calculus for logic $N^{*}$: residual finiteness and decidability. (English)
Algebra Logic 50, No. 3, 245-256 (2011); translation from Algebra i Logika 50, No. 3, 351-367 (2011).
17
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).
18
Sequent calculi and decidability for intuitionistic hybrid logic. (English)
Inf. Comput. 209, No. 12, 1447-1463 (2011).
19
Intuitionistic hybrid logic: introduction and survey. (English)
Inf. Comput. 209, No. 12, 1437-1446 (2011).
20
Result 1 to 20 of 985 total
Start
Contact
Print
General Help
