The following pages link to Journal of Logic and Computation (Q2720311):
Displaying 50 items.
- Which Branching-Time Properties are Effectively Linear? (Q2720312) (← links)
- Nonmonotonic Logics and Semantics (Q2720313) (← links)
- Dynamic Argument Systems: A Formal Model of Argumentation Processes Based on Situation Calculus (Q2720314) (← links)
- Hypersequent Calculi for some Intermediate Logics with Bounded Kripke Models (Q2720315) (← links)
- Conditional Quantification, or Poor Man's Probability (Q2720316) (← links)
- Minimizing Agent Specifications using a Logic of Knowledge and Actions (Q2720318) (← links)
- Ackermann's Implication for Typefree Logic (Q2720395) (← links)
- Revision Sequences and Computers with an Infinite Amount of Time (Q2720396) (← links)
- Multi-agent Only Knowing (Q2720397) (← links)
- Preferential Logics are X-logics (Q2720399) (← links)
- PSPACE Reasoning for Graded Modal Logics (Q2720401) (← links)
- SHR Tableaux -- A Framework for Automated Model Generation (Q2720403) (← links)
- Ideal and Real Belief about Belief (Q2720404) (← links)
- Reviewing the Classical and the de Bruijn Notation for -calculus and Pure Type Systems (Q2752527) (← links)
- Approximation Theorems for Intersection Type Systems (Q2752528) (← links)
- About Folding-Unfolding Cuts and Cuts Modulo (Q2752529) (← links)
- Explicit Substitutions and Reducibility (Q2752530) (← links)
- Algebraic Specifications, Higher-order Types and Set-theoretic Models (Q2752531) (← links)
- Extensional Set Equality in the Calculus of Constructions (Q2752532) (← links)
- Nonmonotonic Inheritance in Object-Oriented Deductive Database Languages (Q2761747) (← links)
- A Semantics for : a Calculus with Overloading and Late-binding (Q2761748) (← links)
- Embedding First-order Logic in a Pure Type System with Parameters (Q2761749) (← links)
- Composition of Default Specifications (Q2761751) (← links)
- Knowledge Compilation for Closed World Reasoning and Circumscription (Q2761752) (← links)
- The Complexity of Poor Man's Logic (Q2761753) (← links)
- On the Soundness and Completeness of Equational Predicate Logics (Q2761754) (← links)
- Bringing them all Together (Q2772879) (← links)
- Internalization: The Case of Hybrid Logics (Q2772880) (← links)
- Relation Algebra with Binders (Q2772881) (← links)
- Modal Logic with Bounded Quantification over Worlds (Q2772882) (← links)
- Resolution in Modal, Description and Hybrid Logic (Q2772883) (← links)
- Sahlqvist Formulas in Hybrid Polyadic Modal Logics (Q2772884) (← links)
- Logic programming with signs and annotations (Q2785669) (← links)
- On winning strategies with unary quantifiers (Q2785670) (← links)
- Strong normalization of substitutions (Q2785671) (← links)
- A-ordered tableaux (Q2785673) (← links)
- Adding metatheoretic facilities to first-order theories (Q2785674) (← links)
- An algebraic perspective of constraint logic programming (Q2785838) (← links)
- Semantic tableaux with equality (Q2785839) (← links)
- A theory of knowledge and ignorance for many agents (Q2785840) (← links)
- How to (plan to) meet a deadline between now and then (Q2785841) (← links)
- Modal logics for incidence geometries (Q2785842) (← links)
- Nested sequent calculi for normal conditional logics (Q2804318) (← links)
- Proof theory of witnessed Gödel logic: A negative result (Q2804319) (← links)
- Spoiled for choice? (Q2804320) (← links)
- Paraconsistent set theory by predicating on consistency (Q2804321) (← links)
- Basic primal infon logic (Q2804323) (← links)
- Universality in two dimensions (Q2804324) (← links)
- A cut-free sequent system for Grzegorczyk logic, with an application to the Gödel–McKinsey–Tarski embedding (Q2804325) (← links)
- On matrices, Nmatrices and games (Q2804326) (← links)
