default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Logic and Computation, Volume 22
Volume 22, Number 1, February 2012
- Ruth Kempson, John Woods:
Editors' Note. 1-6
- Edwin D. Mares
:
Relevance and Conjunction. 7-21 - Michael Franke, Tikitu de Jager, Robert van Rooij:
Relevance in Cooperation and Conflict. 23-54 - Elizabeth Black, Anthony Hunter:
A Relevance-theoretic Framework for Constructing and Deconstructing Enthymemes. 55-78 - John Vervaeke, Timothy P. Lillicrap, Blake A. Richards:
Relevance Realization and the Emerging Framework in Cognitive Science. 79-99 - Dale Jacquette:
Causal Relevance and Relevant Causation. 101-112 - Jonathan E. Adler:
Argument Relevance as the Right Kind of Epistemic Reason. 113-127 - Joseph A. Laronge:
A Generalizable Argument Structure Using Defeasible Class-inclusion Transitivity for Evaluating Evidentiary Probative Relevancy in Litigation. 129-162
Volume 22, Number 2, April 2012
- Arnold Beckmann, Benedikt Löwe:
Computability in Europe 2008. 163-164
- Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen:
Deterministic Graphical Games Revisited. 165-178 - Amir M. Ben-Amram, Bruno Loff, Isabel Oitavem:
Monotonicity Constraints in Characterizations of PSPACE. 179-195 - William C. Calhoun:
Triviality and Minimality in the Degrees of Monotone Complexity. 197-206 - Michiel De Smet, Andreas Weiermann:
Sharp Thresholds for a Phase Transition Related to Weakly Increasing Sequences. 207-211 - Pantelis E. Eleftheriou, Costas D. Koutras, Christos Nomikos:
Notions of Bisimulation for Heyting-Valued Modal Languages. 213-235 - Benny Godlin, Emilia Katz, Johann A. Makowsky:
Graph Polynomials: From Recursive Definitions to Subset Expansion Formulas. 237-265 - Antonina Kolokolova:
Expressing versus Proving: Relating Forms of Complexity in Logic. 267-280 - Lars Kristiansen:
Higher Types, Finite Domains and Resource-bounded Turing Machines. 281-304 - Paulo Oliva:
Hybrid Functional Interpretations of Linear and Intuitionistic Logic. 305-328 - Diana Ratiu, Trifon Trifonov:
Exploring the Computational Content of the Infinite Pigeonhole Principle. 329-350
Volume 22, Number 3, June 2012
- Steffen Lewitzka:
Semantically closed intuitionistic abstract logics. 351-374 - Gerard R. Renardel de Lavalette, Alex Hendriks, Dick de Jongh:
Intuitionistic implication without disjunction. 375-404
- Andreas Witzel:
Characterizing perfect recall using next-step temporal operators in S5 Epistemic Temporal Logic. 405-416
- Simone Bova, Diego Valota:
Finite RDP-algebras: duality, coproducts and logic. 417-450
- Guillaume Aucher:
Private announcement and belief expansion: an internal perspective. 451-479 - Kedian Mu, Weiru Liu, Zhi Jin:
Measuring the blame of each formula for inconsistent prioritized knowledge bases. 481-516 - Walter Hussak:
Monodic temporal logic with quantified propositional variables. 517-544 - Saeed Salehi:
Separating bounded arithmetical theories by Herbrand consistency. 545-560 - Razvan Diaconescu:
Borrowing interpolation. 561-586 - Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of reasoning for fragments of default logic. 587-604 - Giorgi Japaridze:
A logical basis for constructive systems. 605-642 - Manuel Bodirsky, Peter Jonsson, Timo von Oertzen:
Horn versus full first-order: Complexity dichotomies in algebraic constraint satisfaction. 643-660
- Félix Bou, Francesc Esteva, Josep Maria Font, Àngel J. Gil, Lluís Godo, Antoni Torrens, Ventura Verdú:
Logics preserving degrees of truth from varieties of residuated lattices. 661-665
Volume 22, Number 4, August 2012
- Alexandra A. Soskova, S. Barry Cooper, Andrea Sorbi:
Computability at Logic Colloquium 2009. 667
- Marat M. Arslanov:
Model-theoretic properties of the n-c.e. degrees. 669-677 - George Barmpalias:
Compactness arguments with effectively closed sets for the study of relative randomness. 679-691 - George Barmpalias, André Nies:
Low upper bounds in the Turing degrees revisited. 693-699 - Laurent Bienvenu, Rupert Hölzl, Thorsten Kräling, Wolfgang Merkle:
Separations of non-monotonic randomness notions. 701-715 - Angel V. Ditchev:
Least enumerations of partial structures. 717-735 - Marat Kh. Faizrahmanov, Iskander Sh. Kalimullin:
Turing and enumeration jumps in the Ershov hierarchy. 737-743 - Andrey N. Frolov:
Low linear orderings. 745-754 - Andrey N. Frolov, Iskander Sh. Kalimullin, Valentina S. Harizanov, Oleg V. Kudinov, Russell G. Miller:
Spectra of highn and non-lown degrees. 755-777 - Hristo Ganchev, Mariya Ivanova Soskova:
Embedding distributive lattices in the Σ02 enumeration degrees. 779-792 - Alexander Gavryushkin:
On constructive models of theories with linear Rudin-Keisler ordering. 793-805 - Charles M. Harris:
Non-cuppable enumeration degrees via finite injury. 807-829 - Iskander Sh. Kalimullin:
Algorithmic reducibilities of algebraic structures. 831-843 - Andrew E. M. Lewis:
Properties of the jump classes. 845-855 - Antonio Montalbán:
Counting the back-and-forth types. 857-876 - Anthony Morphett:
Prompt enumerations and relative randomness. 877-897 - Dimiter Skordev, Andreas Weiermann, Ivan Georgiev:
M2-computable real numbers. 899-925 - Mariya Ivanova Soskova, Ivan N. Soskov:
Embedding countable partial orderings in the enumeration degrees and the ω-enumeration degrees. 927-952
Volume 22, Number 5, October 2012
- Sanjay Modgil, Francesca Toni:
Special Issue on Argumentation in Agreement Technologies. 953-956 - Leila Amgoud, Srdjan Vesic:
A formal analysis of the role of argumentation in negotiation dialogues. 957-978 - Yuqing Tang, Kai Cai, Peter McBurney, Elizabeth Sklar, Simon Parsons:
Using argumentation to reason about trust and belief. 979-1018
- Leila Amgoud, Srdjan Vesic:
Revising option status in argument-based decision systems1. 1019-1058
- Stéphane Demri, Deepak D'Souza, Régis Gascon:
Temporal Logics of Repeating Values. 1059-1096 - Norihiro Kamide:
Embedding-based approaches to paraconsistent and temporal description logics. 1097-1124 - Francicleber Martins Ferreira, Ana Teresa C. Martins:
Expressible preferential logics. 1125-1143 - Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity Classifications for Propositional Abduction in Post's Framework. 1145-1170 - Meghdad Ghari:
Cut Elimination and Realization for Epistemic Logics with Justification. 1171-1198 - Vladimir V. Rybakov:
Writing out Unifiers in Linear Temporal Logic. 1199-1206 - Martin W. A. Caminada, Walter Alexandre Carnielli, Paul E. Dunne:
Semi-stable semantics. 1207-1254
Volume 22, Number 6, December 2012
- Luís Moniz Pereira:
Turing is among us. 1257-1277
- Juan Carlos García-Bermejo:
A plea for the majority method in aggregating judgements. 1279-1299
- Alexander Artikis:
Dynamic specification of open agent systems. 1301-1334 - Sebastian Enqvist:
Modelling epistemic actions in interrogative belief revision. 1335-1365
- Pilar Dellunde:
Preserving mappings in fuzzy predicate logics. 1367-1389
- Eugenio G. Omodeo, Alberto Policriti, Alexandru I. Tomescu:
Infinity, in short. 1391-1403 - Radim Belohlávek:
Optimal decompositions of matrices with entries from residuated lattices. 1405-1425 - Richard Garner:
An abstract view on syntax with sharing. 1427-1452 - Amílcar Sernadas, Cristina Sernadas, João Rasga:
On meet-combination of logics. 1453-1470
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-08 20:34 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:
