default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Logic and Computation, Volume 16
Volume 16, Number 1, February 2006
- David J. Pym:
Editorial. 1-3
- Miki Tanaka, John Power
:
A Unified Category-theoretic Semantics for Binding Signatures in Substructural Logics. 5-25 - Rohit Chadha, Damiano Macedonio, Vladimiro Sassone:
A Hybrid Intuitionistic Logic: Semantics and Decidability. 27-59 - Tatjana Lutovac, James Harland:
Detecting Loops During Proof Search in Propositional Affine Logic. 61-133 - Jeff Polakow:
Linearity Constraints as Bounded Intervals in Linear Logic Programming. 135-155
Volume 16, Number 2, April 2006
- Barteld P. Kooi, Gerard R. Renardel de Lavalette, Rineke Verbrugge:
Hybrid Logics with Infinitary Proof Systems. 161-175 - Nick Bezhanishvili, Balder ten Cate:
Transfer Results for Hybrid Logic. Part I: The Case Without Satisfaction Operators. 177-197 - Morteza Moniri:
An Independence Result for Intuitionistic Bounded Arithmetic. 199-204 - Petr Savický, Roberto Cignoli, Francesc Esteva, Lluís Godo, Carles Noguera:
On Product Logic with Truth-constants. 205-225 - Jorge García Duque, Martín López Nores, José Juan Pazos-Arias, Ana Fernández Vilas, Rebeca P. Díaz Redondo, Alberto Gil-Solla, Yolanda Blanco-Fernández, Manuel Ramos Cabrer:
A Six-valued Logic to Reason about Uncertainty and Inconsistency in Requirements Specifications. 227-255 - Zoran Ognjanovic:
Discrete Linear-time Probabilistic Logics: Completeness, Decidability and Complexity. 257-285 - Riccardo Pucella:
Deductive Algorithmic Knowledge. 287-309
Volume 16, Number 3, June 2006
- Quoc Bao Vo, Abhaya C. Nayak, Norman Y. Foo:
A Syntax-based Approach to Reasoning about Action and Belief Update. 315-338 - Razvan Diaconescu:
Proof Systems for Institutional Logic. 339-357 - Manuel Bodirsky, Jaroslav Nesetril:
Constraint Satisfaction with Countable Homogeneous Templates. 359-373 - M. Birna van Riemsdijk, Frank S. de Boer, John-Jules Ch. Meyer:
Dynamic Logic for Plan Revision in Agent Programming. 375-402
Volume 16, Number 4, August 2006
- George Metcalfe:
Proof Theory for Casari's Comparative Logics. 405-422 - Franco Montagna, Carles Noguera, Rostislav Horcík:
On Weakly Cancellative Fuzzy Logics. 423-450 - Rafal Urbaniak:
On Representing Sentential Connectives of Lesniewski's Elementary Protothetic. 451-460 - Danièle Beauquier, Alexander Moshe Rabinovich, Anatol Slissenko:
A Logic of Probability with Decidable Model Checking. 461-487 - Giorgi Japaridze:
Introduction to Cirquent Calculus and Abstract Resource Semantics. 489-532
Volume 16, Number 5, October 2006
- Valentin B. Shehtman:
Editorial. 539 - Philippe Balbiani, Tinko Tinchev:
Definability Over the Class of all Partitions. 541-557 - Jan M. Broersen, Andreas Herzig, Nicolas Troquard:
Embedding Alternating-time Temporal Logic in Strategic STIT Logic of Agency. 559-578 - Willem Conradie, Valentin Goranko, Dimiter Vakarelov:
Algorithmic Correspondence and Completeness in Modal Logic. II. Polyadic and Hybrid Extensions of the Algorithm SQEMA. 579-612 - Davide Grossi, John-Jules Ch. Meyer, Frank Dignum:
Classificatory Aspects of Counts-as: An Analysis in Modal Logic. 613-643 - Vladimir Krupski:
Reference Constructions in the Single-conclusion Proof Logic. 645-661 - Ilya Mezhirov:
A Game Semantics for Grz. 663-669 - Natalia Rubtsova:
On Realization of S5-modality by Evidence Terms. 671-684 - Dmitrij P. Skvortsov:
On Non-axiomatizability of Superintuitionistic Predicate Logics of Some Classes of Well-founded and Dually Well-founded Kripke Frames. 685-695 - Tatiana Yavorskaya:
Logic of Proofs and Labels with a Complete Set of Operations. 697-710
Volume 16, Number 6, December 2006
- Daniel Gâinâ, Andrei Popescu:
An Institution-independent Generalization of Tarski's Elementary Chain Theorem. 713-735 - Thomas Bolander, Torben Braüner:
Tableau-based Decision Procedures for Hybrid Logic. 737-763 - Dirk Walther, Carsten Lutz, Frank Wolter, Michael J. Wooldridge:
ATL Satisfiability is Indeed EXPTIME-complete. 765-787 - Wendy MacCaull, Ewa Orlowska:
A Logic of Type Relations and its Applications to Relational Databases. 789-815 - Argimiro Arratia, Carlos E. Ortiz:
Expressive Power and Complexity of a Logic with Quantifiers that Count Proportions of Sets. 817-840 - Raymond Turner:
Computability in Specification. 841-865 - Mauricio Osorio, Juan Antonio Navarro Pérez, José R. Arrazola Ramírez, Verónica Borja Macías:
Logics with Common Weak Completions. 867-890 - Ernest Davis:
The Expressivity of Quantifying over Regions. 891-916
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 2025-12-08 09:50 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:
