Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLogic Journal of the IGPL, Volume 8, 2000
Volume 8, Number 1, January 2000
- Neil Ghani, Valeria de Paiva, Eike Ritter:
Linear Explicit Substitutions. 7-31 - Costas D. Koutras, Stathis Zachos:
Many-Valued Reflexive Autoepistemic Logic. 33-54 - Orna Lichtenstein, Amir Pnueli:
Propositional Temporal Logics: Decidability and Completeness. 55-85 - Wojciech Penczek:
Temporal Approach to Causal Knowledge. 87-99 - Tara Nicholson, Ray E. Jennings, Darko Sarenac:
Revisiting completeness for the Kn modal logics: A new proof. 101-105
Volume 8, Number 2, March 2000
- Ofer Arieli, Arnon Avron:
General Patterns for Nonmonotonic Reasoning: From Basic Entailments to Plausible Relations. 119-148 - Faiza Belala, Mohamed Bettaz, Laure Petrucci-Dauchy:
Concurrent Systems Analysis Using ECATNets. 149-164 - Dov M. Gabbay, Valentin B. Shehtman:
Products of modal logics. Part 2: Relativised quantifiers in classical logic. 165-210 - Alessandra Palmigiano:
Normal Gentzen Deductions in the Classical Case. 211-219
Volume 8, Number 3, May 2000
- Carlos Areces, Enrico Franconi, Rajeev Goré, Maarten de Rijke, Bernd-Holger Schlingloff:
Editorial. 231-237 - Ian Horrocks, Ulrike Sattler, Stephan Tobies:
Practical Reasoning for Very Expressive Description Logics. 239-263 - Ullrich Hustadt, Hans de Nivelle, Renate A. Schmidt:
Resolution-Based Methods for Modal Logics. 265-292 - Ian Horrocks, Peter F. Patel-Schneider, Roberto Sebastiani:
An Analysis of Empirical Testing for Modal Decision Procedures. 293-323 - Natasha Alechina, Neil Immerman:
Reachability Logic: An Efficient Fragment of Transitive Closure Logic. 325-337 - Patrick Blackburn:
Representation, Reasoning, and Relational Structures: a Hybrid Logic Manifesto. 339-365
Volume 8, Number 4, July 2000
- Editorial. 379-381
- Paul R. Halmos:
An autobiography of Polyadic Algebras. 383-392 - Robert Goldblatt:
Algebraic Polymodal Logic: A Survey. 393-450 - J. Donald Monk:
An Introduction to Cylindric Set Algebras. 451-496 - Ildikó Sain:
On the Search for a Finitizable Algebraization of First Order Logic. 497-591
Volume 8, Number 5, September 2000
- Ruy J. G. B. de Queiroz:
Editorial. 603-604 - John T. Baldwin:
Finite and Infinite Model Theory - A Historical Perspective. 605-628 - Torben Braüner:
A Cut-Free Gentzen Formulation of the Modal Logic S5. 629-643 - Eduardo L. Fermé
:
Irrevocable Belief Revision and Epistemic Entrenchment. 645-652 - Carlos Areces, Patrick Blackburn, Maarten Marx:
The Computational Complexity of Hybrid Temporal Logics. 653-679 - Angelo Montanari, Adriano Peron, Alberto Policriti:
The Taming (Timing) of the States. 681-699 - André Nies:
Model theory of the computably enumerable many-one degrees. 701-706
Volume 8, Number 6, November 2000
- Johan van Benthem:
Information Transfer across Chu Spaces. 719-731 - Carlo Cellucci:
Analytic Cut Trees. 733-750 - Marcel Crabbé:
On the Set of Atoms. 751-759 - Ryo Kashima:
Completeness of Implicational Relevant Logics. 761-785 - Søren Riis, Meera Sitharam:
Generating hard tautologies using predicate logic and the symmetric group. 787-795 - Larisa Maksimova:
Strongly Decidable Properties of Modal and Intuitionistic Calculi. 797-819 - Michael Mendler:
Characterising Combinational Timing Analyses in Intuitionistic Modal Logic. 821-852 - Greg Restall:
Defining Double Negation Elimination. 853-860 - Evgeni E. Zolin:
Embeddings of Propositional Monomodal Logics. 861-882
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-22 20:03 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
