Found: 6
Select item for more details and to access through your institution.
All Finitely Axiomatizable Tense Logics of Linear Time Flows Are CoNP-complete.
- Published in:
- Studia Logica, 2005, v. 81, n. 2, p. 153, doi. 10.1007/s11225-005-3702-8
- By:
- Publication type:
- Article
Łukasiewicz-Moisil Relation Algebras.
- Published in:
- Studia Logica, 2005, v. 81, n. 2, p. 167, doi. 10.1007/s11225-005-3703-7
- By:
- Publication type:
- Article
Proof-Theoretic Functional Completeness for the Hybrid Logics of Everywhere and Elsewhere.
- Published in:
- Studia Logica, 2005, v. 81, n. 2, p. 191, doi. 10.1007/s11225-005-3704-6
- By:
- Publication type:
- Article
Structural Subsumption and Least Common Subsumers in a Description Logic with Existential and Number Restrictions.
- Published in:
- Studia Logica, 2005, v. 81, n. 2, p. 227, doi. 10.1007/s11225-005-3705-5
- By:
- Publication type:
- Article
On the Predicate Logic of Linear Kripke Frames and some of its Extensions.
- Published in:
- Studia Logica, 2005, v. 81, n. 2, p. 261, doi. 10.1007/s11225-005-3706-4
- By:
- Publication type:
- Article
Igor Lavrov and Larisa Maksimova, Problems in Set Theory, Mathematical Logic and the Theory of Algorithms, Edited by Giovanna Corsi, Translated by Valentin Shehtman, Kluwer Academic/Plenum Publishers, New York, 2003, US$141.00, pp. xi + 282, ISBN 0-306-47712-2, hardbound
- Published in:
- Studia Logica, 2005, v. 81, n. 2, p. 283, doi. 10.1007/s11225-005-3707-3
- By:
- Publication type:
- Article