default search action
Journal of Logic and Computation, Volume 20
Volume 20, Number 1, February 2010
- Nicola Olivetti:
Preface. 1-3
- Franz Baader
, Rafael Peñaloza
Axiom Pinpointing in General Tableaux. 5-34 - Matthias Baaz
Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic. 35-54 - Philippe Balbiani
Tableaux for Public Announcement Logic. 55-76 - Peter Baumgartner, Ulrich Furbach, Björn Pelzer:
The Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation. 77-109 - Shoham Ben-David, Richard J. Trefler, Grant E. Weddell:
Model Checking Using Description Logic. 111-131 - Davide Bresolin
Tableaux for Logics of Subinterval Structures over Dense Orderings. 133-166 - Marcelo Finger
Analytic Methods for the Logic of Proofs. 167-188 - Didier Galmiche, Daniel Méry:
Tableaux and Resource Graphs for Separation Logic. 189-231 - Rajeev Goré, Linda Postniece:
Combining Derivations and Refutations for Cut-free Completeness in Bi-intuitionistic Logic. 233-260 - Neil V. Murray, Erik Rosenthal:
Reduced Implicate Tries with Updates. 261-281 - Nicolas Peltier:
Bottom-up Construction of Semantic Tableaux. 283-308 - André Platzer
Differential-algebraic Dynamic Logic for Differential-algebraic Programs. 309-352 - Regimantas Pliuskevicius, Aida Pliuskeviciene:
A New Method to Obtain Termination in Backward Proof Search For Modal Logic S4. 353-379
- Regimantas Pliuskevicius, Aida Pliuskeviciene:
A New Method to Obtain Termination in Backward Proof Search for Modal Logic S4. 381-387
Volume 20, Number 2, April 2010
- Petr Hájek:
On White's Expansion of Lukasiewicz Logic. 389-397 - Franco Montagna, Carles Noguera
Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics. 399-424 - Emil Jerábek
Admissible Rules of Lukasiewicz Logic. 425-447
- Roberto Giacobazzi, Isabella Mastroeni
A Proof System for Abstract Non-interference. 449-479
- Robin Hirsch
The Complexity of the Warranted Formula Problem in Propositional Argumentation. 481-499
- Murdoch James Gabbay
A Nominal Axiomatization of the Lambda Calculus. 501-531 - Stefania Costantini
Answer Set Programming with Resources. 533-571 - Juan Carlos Agudelo Agudelo
Paraconsistent Machines and their Relation to Quantum Computing. 573-595 - Olivier Hermant, James Lipton:
Completeness and Cut-elimination in the Intuitionistic Theory of Types - Part 2. 597-602 - Stephan Hartmann, Gabriella Pigozzi, Jan Sprenger
Reliable Methods of Judgement Aggregation. 603-617 - Félix Bou, Francesco Paoli, Antonio Ledda
The Logic of Quasi-MV Algebras. 619-643
- Stanislav Kikot:
Relation Algebras by Games, by Robin Hirsch and Ian Hodkinson. 645-648
Volume 20, Number 3, June 2010
- Oleg Sokolsky, Serdar Tasiran:
Editorial. 649-650
- Andreas Bauer, Martin Leucker
Comparing LTL Semantics for Runtime Verification. 651-674 - Howard Barringer, David E. Rydeheard, Klaus Havelund:
Rule Systems for Run-time Monitoring: from Eagle to RuleR. 675-706 - Eric Bodden
Collaborative Runtime Verification with Tracematches. 707-723 - Ingolf H. Krüger, Michael Meisinger, Massimiliano Menarini:
Interaction-based Runtime Verification for Systems of Systems Integration. 725-742 - Volker Stolz:
Temporal Assertions with Parametrized Propositions. 743-757
Volume 20, Number 4, July 2010
- George Metcalfe, Constantine Tsinakis:
Order, Algebra and Logics. 759-760
- Manuela Busaniche, Roberto Cignoli:
Constructive Logic with Strong Negation as a Substructural Logic. 761-793 - Roberto Giuntini
Categorical Equivalences for sqrt(') quasi-MV Algebras. 795-810 - Stefano Aguzzoli
Finitely Presented MV-algebras with Finite Automorphism Group. 811-822 - Hitoshi Kihara, Hiroakira Ono:
Interpolation Properties, Beth Definability Properties and Amalgamation Properties for Substructural Logics. 823-875 - Giulio Manzonetto, Antonino Salibra
Applying Universal Algebra to Lambda Calculus. 877-915 - Ciro Russo
Quantale Modules and their Operators, with Applications. 917-946 - Lawrence S. Moss:
Syllogistic Logics with Verbs. 947-967 - James G. Raftery:
A Non-finitary Sentential Logic that is Elementarily Algebraizable. 969-975 - Rostislav Horcík
Solutions to Some Open Problems on Totally Ordered Monoids. 977-983
Volume 20, Number 5, October 2010
- Alexander Kurz
Coalgebra and Logic: A Brief Overview. 985-990
- Jirí Adámek, H. Peter Gumm, Vera Trnková:
Presentation of Set Functors: A Coalgebraic Perspective. 991-1015 - Nick Bezhanishvili
Vietoris Bisimulations. 1017-1040 - Bart Jacobs, Ana Sokolova
Exemplaric Expressivity of Modal Logics. 1041-1068 - Robert Goldblatt
Deduction Systems for Coalgebras Over Measurable Spaces. 1069-1100 - Lawrence S. Moss:
A Note on Expressive Coalgebraic Logics for Finitary Set Functors. 1101-1111 - Lutz Schröder
Rank-1 Modal Logics are Coalgebraic. 1113-1147
Volume 20, Number 6, December 2010
- Emil Jerábek
Bases of Admissible Rules of Lukasiewicz Logic. 1149-1163
- Daniel Gâinâ
Completeness by Forcing. 1165-1186
- Andrzej Wisniewski
Interrogatives, Recursion, and Incompleteness. 1187-1199
- Heinrich Wansing
Intuitionistic Trilattice Logics. 1201-1229 - Robert Demolombe, Luis Fariñas del Cerro:
Information About a Given Entity: From Semantics Towards Automated Deduction. 1231-1250 - Ken Mano, Yoshinobu Kawabe, Hideki Sakurada, Yasuyuki Tsukada:
Role Interchange for Anonymity and Privacy of Voting. 1251-1288
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-11-21 20:30 CET 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: