default search action
Logic Journal of the IGPL, Volume 17, 2009
Volume 17, Number 1, February 2009
- Dov M. Gabbay, Karl Schlechta:
Defeasible inheritance systems and reactive diagrams. 1-54 - G. S. Mahalakshmi, T. V. Geetha:
An Indian logic-based argument representation formalism for knowledge-sharing. 55-76 - Martin Caminada, Yining Wu:
An argument game for stable semantics. 77-90 - Xavier Caicedo, Francien Dechesne, Theo M. V. Janssen:
Equivalence and quantifier rules for logic with imperfect information. 91-129 - Argimiro Arratia, Carlos E. Ortiz:
Approximate formulae for a logic that capture classes of computational complexity. 131-154
Volume 17, Number 2, April 2009
- Çigdem Gencer, Dick De Jongh:
Unifiability in extensions of K4. 159-172 - Iris Loeb:
Indecomposability of negative dense subsets of R in Constructive Reverse Mathematics. 173-177 - Fernando Tohmé:
Economic theory and the Alternative Set Theory AFA-+AD+DC. 179-203 - Michal Krupka:
Factorization of residuated lattices. 205-223
Volume 17, Number 3, June 2009
- Guido Governatori, Vineet Padmanabhan, Antonino Rotolo, Abdul Sattar:
A defeasible logic for modelling policy-based intentions and motivational attitudes. 227-265 - Mohamed Khaled, Tarek Sayed Ahmed:
On complete representations of algebras of logic. 267-272 - Guido Boella, Luigi Sauro, Leendert W. N. van der Torre:
Algorithms for finding coalitions exploiting a new reciprocity condition. 273-297 - Thomas Ågotnes, Wiebe van der Hoek, Michael J. Wooldridge:
Logics for Qualitative Coalitional Games. 299-321
Volume 17, Number 4, August 2009
- Ofer Arieli, Anna Zamansky:
Distance-based non-deterministic semantics for reasoning with uncertainty. 325-350 - Cristian S. Calude, Nicholas J. Hay:
Every computably enumerable random real is provably computably enumerable random. 351-374 - Joanna Golinska-Pilarek, Emilio Muñoz-Velasco:
Relational approach for a logic for order of magnitude qualitative reasoning with negligibility, non-closeness and distance. 375-394 - Antonio Di Nola, Michal Holcapek, Gejza Jenca:
The category of MV-pairs. 395-412 - San-Min Wang, Bin Zhao:
HpsUL is not the logic of pseudo-uninorms and their residua. 413-419 - Rohan French:
A simplified embedding of E into monomodal K. 421-428 - Judit X. Madarász, Tarek Sayed Ahmed:
Neat reducts and amalgamation in retrospect, a survey of results and some methods Part I: Results on neat reducts. 429-483
Volume 17, Number 5, October 2009
- Mauricio Ayala-Rincón, Edward Hermann Haeusler:
Preface. 487-488
- Gilles Dowek:
On the convergence of reduction-based and model-based methods in proof theory. 489-497 - Marco Gaboardi, Simona Ronchi Della Rocca:
From light logics to type assignments: a case study. 499-530 - Alexandre Matos Arruda, Ana Teresa C. Martins:
Natural deduction for the finite least fixed point logic with an infinitary rule. 531-558 - Mario R. F. Benevides, Luis Menasché Schechter:
Using modal logics to express and check global graph properties. 559-587
Volume 17, Number 6, December 2009
- Fabrizio Riguzzi:
Extended semantics and inference for the Independent Choice Logic. 589-629 - Howard Barringer, Dov M. Gabbay, David E. Rydeheard:
Modelling evolvable component systems: Part I: A logical framework. 631-696 - Daniel Lima Ventura, Mauricio Ayala-Rincón, Fairouz Kamareddine:
Explicit substitutions calculi with one step Eta-reduction decided explicitly. 697-718 - Allen L. Mann:
Independence-friendly cylindric set algebras. 719-754 - Judit X. Madarász, Tarek Sayed Ahmed:
Neat reducts and amalgamation in retrospect, a survey of results and some methods Part II: Results on amalgamation. 755-802
- Igor Carboni Oliveira, Walter Alexandre Carnielli:
Erratum to "The Ricean Objection: An Analogue of Rice's Theorem for First-Order Theories" . Logic Journal of the IGPL, 16(6): 585-590(2008). 803-804
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.