Result 1 to 20 from 219 total
Sahlqvist correspondence for modal mu-calculus. (English)
Stud. Log. 100, No. 1-2, 31-60 (2012).
1
Delimited control operators prove double-negation shift. (English)
Ann. Pure Appl. Logic 163, No. 11, 1549-1559 (2012).
2
The Peirce translation. (English)
Ann. Pure Appl. Logic 163, No. 6, 681-692 (2012).
3
Decidability of the weak interpolation property over the minimal logic. (English)
Algebra Logic 50, No. 2, 106-132 (2011); translation from Algebra i Logika 50, No. 2, 152-188 (2011).
4
Joint consistency in extensions of the minimal logic. (English)
Sib. Math. J. 51, No. 3, 479-490 (2010); translation from Sib. Mat. Zh. 51, No. 3, 604-619 (2010).
5
The Peirce translation and the double negation shift. (English)
Ferreira, Fernando (ed.) et al., Programs, proofs, processes. 6th conference on computability in Europe, CiE 2010, Ponta Delgada, Azores, Portugal, June 30‒July 4, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13961-1/pbk). Lecture Notes in Computer Science 6158, 151-161 (2010).
6
Weighted o-minimal hybrid systems. (English)
Ann. Pure Appl. Logic 161, No. 3, 268-288 (2009).
7
Enumerating proofs of positive formulae. (English)
Comput. J. 52, No. 7(A), 799-807 (2009).
8
Subminimal logic and weak algebras. (English)
Rep. Math. Logic 44, 153-166 (2009).
9
Elimination of the non-minimal covering of preserving binary regularly separable relations in partial four-valued logic. (Chinese)
J. Shandong Univ., Nat. Sci. 43, No. 12, 24-27 (2008).
10
Operational semantics of Framed Tempura. (English)
J. Log. Algebr. Program. 78, No. 1, 22-51 (2008).
11
On minimal coalgebras. (English)
Appl. Categ. Struct. 16, No. 3, 313-332 (2008).
12
Constructive negations and paraconsistency. (English)
Trends in Logic‒Studia Logica Library 26. Dordrecht: Springer (ISBN 978-1-4020-6866-9/hbk). vi, 240~p. EUR~139.05 (2008).
13
First-order ground non-monotonic modal logic. (English)
Fundam. Inform. 83, No. 3, 253-276 (2008).
14
Framed temporal logic programming. (English)
Sci. Comput. Program. 70, No. 1, 31-61 (2008).
15
A logic programming framework for combinational circuit synthesis. (English)
Dahl, Verónica (ed.) et al., Logic programming. 23rd international conference, ICLP 2007, Porto, Portugal, September 8‒13, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74608-9/pbk). Lecture Notes in Computer Science 4670, 180-194 (2007).
16
A method of proving interpolation in paraconsistent extensions of the minimal logic. (Russian ;English)
Algebra Logika 46, No. 5, 627-648 (2007); translation in Algebra Logic 46, No. 5, 341-353 (2007).
17
The decision of minimal covering of function classes preserving ternary simply separable relations in partial four-valued logic. (Chinese)
Nat. Sci. J. Xiangtan Univ. 29, No. 1, 33-36 (2007).
18
The decision of not belonging to the minimal covering members of function sets preserving ternary regularly separable relations in partial four-valued logic. (Chinese)
J. Hunan Inst. Sci. Technol., Nat. Sci. 20, No. 4, 16-18 (2007).
19
A new modal approach to the logic of intervals. (English)
J. Log. Comput. 17, No. 2, 221-254 (2007).
20
Result 1 to 20 from 219 total
Start
Contact
Print
General Help
