default search action
60. Birthday: Dov M. Gabbay, 2005
- Sergei N. Artëmov, Howard Barringer, Artur S. d'Avila Garcez, Luís C. Lamb, John Woods:
We Will Show Them! Essays in Honour of Dov Gabbay, Volume One. College Publications 2005, ISBN 1-904987-25-7 - Samson Abramsky:
A Cook's Tour of the Finitary Non-Well-Founded Sets. We Will Show Them! (1) 2005: 1-18 - Sergei N. Artëmov:
Existential Semantics for Modal Logic. We Will Show Them! (1) 2005: 19-30 - David Ahn, Sisay Fissaha Adafre, Maarten de Rijke:
Recognizing and Interpreting Temporal Expressions in Open Domain Texts. We Will Show Them! (1) 2005: 31-50 - Atocha Aliseda-Llera:
What is a Logical System? A Commentary. We Will Show Them! (1) 2005: 51-56 - Amihood Amir:
Two Glass Balls and a Tower. We Will Show Them! (1) 2005: 57-76 - Carlos Areces, Patrick Blackburn:
Reichenbach, Prior and Montague: A Semantic Get-together. We Will Show Them! (1) 2005: 77-88 - Wouter van Atteveldt, Stefan Schlobach:
A Modal View on Polder Politics. We Will Show Them! (1) 2005: 89-104 - Arnon Avron:
Logical Non-determinism as a Tool for Logical Modularity: An Introduction. We Will Show Them! (1) 2005: 105-124 - Matthias Baaz, Rosalie Iemhoff:
On the Proof Theory of the Existence Predicate. We Will Show Them! (1) 2005: 125-166 - Sebastian Bader, Pascal Hitzler:
Dimensions of Neural-symbolic Integration - A Structured Survey. We Will Show Them! (1) 2005: 167-194 - Howard Barringer, David E. Rydeheard:
Modelling Evolvable Systems: A Temporal Logic View. We Will Show Them! (1) 2005: 195-228 - Johan van Benthem:
Open Problems in Logic and Games. We Will Show Them! (1) 2005: 229-264 - Alexander Bochman:
Nonmonotonic Reasoning. We Will Show Them! (1) 2005: 265-308 - Krysia Broda, Alessandra Russo:
Compiled Labelled Deductive Systems for Access Control. We Will Show Them! (1) 2005: 309-338 - Peter Bruza, Richard J. Cole II:
Quantum Logic of Semantic Space: An Exploratory Investigation of Context Effects in Practical Reasoning. We Will Show Them! (1) 2005: 339-362 - Carlos Caleiro, Amílcar Sernadas, Cristina Sernadas:
Fibring Logics: Past, Present and Future. We Will Show Them! (1) 2005: 363-388 - Walter Alexandre Carnielli, Marcelo E. Coniglio:
Splitting Logics. We Will Show Them! (1) 2005: 389-414 - Ariel Cohen, Michael Kaminski, Johann A. Makowsky:
Indistinguishability by Default. We Will Show Them! (1) 2005: 415-428 - Marcello D'Agostino:
Classical Natural Deduction. We Will Show Them! (1) 2005: 429-468 - Artur S. d'Avila Garcez, Luís C. Lamb:
Neural-Symbolic Systems and the Case for Non-Classical Reasoning. We Will Show Them! (1) 2005: 469-488 - Anuj Dawar:
How Many First-order Variables are Needed on Finite Ordered Structures? We Will Show Them! (1) 2005: 489-520 - Jürgen Dix, Ugur Kuter, Dana S. Nau:
Planning in Answer Set Programming using Ordered Task Decomposition. We Will Show Them! (1) 2005: 521-576 - Kosta Dosen, Zoran Petric:
Negation and Involutive Adjunctions. We Will Show Them! (1) 2005: 577-586 - Luis Fariñas del Cerro, Olivier Gasquet, Andreas Herzig, Mohamad Sahade:
Modal Tableaux: Completeness vs. Termination. We Will Show Them! (1) 2005: 587-614 - Paolo Ferraris, Vladimir Lifschitz:
Mathematical Foundations of Answer Set Programming. We Will Show Them! (1) 2005: 615-664 - Melvin Fitting:
A Mistake on My Part. We Will Show Them! (1) 2005: 665-670 - Marcelo Finger:
DAG Sequents with Substitution. We Will Show Them! (1) 2005: 671-686 - Chris Fox, Shalom Lappin:
Polymorphic Quantifiers and Underspecification in Natural Language. We Will Show Them! (1) 2005: 687-700 - Michael Gabbay, Murdoch Gabbay:
Some Formal Considerations on Gabbay's Restart Rule in Natural Deduction and Goal-Directed Reasoning. We Will Show Them! (1) 2005: 701-730 - Murdoch Gabbay, Michael Gabbay:
a-logic. We Will Show Them! (1) 2005: 731-764
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.