The following pages link to Journal Of Logic And Computation (Q2983390):
Displaying 50 items.
- A Tableaux Method for Systematic Simultaneous Search for Refutations and Models using Equational Problems (Q4272502) (← links)
- Learning Theory and Descriptive Set Theory (Q4272503) (← links)
- Formalizing a Hierarchical Structure of Practical Mathematical Reasoning (Q4272504) (← links)
- An <b><i>O</i>(<i>n</i> log <i>n</i>)</b>-Space Decision Procedure for Intuitionistic Propositional Logic (Q4272505) (← links)
- Lazy Theories of Operations and Types (Q4272506) (← links)
- Naming and Identity in Epistemic Logics Part I: The Propositional Case (Q4276167) (← links)
- Defeasible Logic is Stable (Q4276168) (← links)
- Logic Programs for Primitive Recursive Sets (Q4276169) (← links)
- Composing Open Logic Programs (Q4276170) (← links)
- Injective Models and Disjunctive Relations (Q4276171) (← links)
- Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL (Q4276172) (← links)
- The Relevance Graph of a BCK-Formula (Q4276173) (← links)
- A Complete Proof Synthesis Method for the Cube of Type Systems (Q4276174) (← links)
- Defeasible Dialectics: A Controversy-Oriented Approach towards Defeasible Argumentation (Q4276175) (← links)
- A Fixed Point Semantics for the ATMS (Q4276177) (← links)
- Unbounded Non-determinism in CSP (Q4276178) (← links)
- Systems for Knowledge and Belief (Q4276179) (← links)
- A Deductive System for Existential Least Fixpoint Logic (Q4276180) (← links)
- Modelling Prolog Control (Q4286208) (← links)
- On the Correspondence Between Modal and Classical Logic: an Automated Approach (Q4286209) (← links)
- Ordered Logic Programming with Sets (Q4286210) (← links)
- Principal Type Schemes for the Strict Type Assignment System (Q4286211) (← links)
- Inhabitation in Intersection and Union Type Assignment Systems (Q4286212) (← links)
- A Hypothetical Reasoning Algorithm for Linguistic Analysis (Q4286213) (← links)
- Solution to a Problem of Goranko and Passy (Q4286214) (← links)
- The Monotonous Elimination of Predicate Variables (Q4286215) (← links)
- A Proof-theoretic Analysis of Goal-directed Provability (Q4286216) (← links)
- Circumscription in Data Logic for Data Type Specification (Q4286217) (← links)
- Directly Sceptical Inheritance Cannot Capture the Intersection of Extensions (Q4286218) (← links)
- Supporting Transformations for the Partial Evaluation of Logic Programs (Q4286220) (← links)
- Levationis Laus (Q4286221) (← links)
- How to Do Things with Worlds: on Formalizing Actions and Plans (Q4286222) (← links)
- 2-Sequent Calculus: Intuitionism and Natural Deduction (Q4286223) (← links)
- Intersection Types as Logical Formulae (Q4291035) (← links)
- Sequent Calculi for Normal Modal Propositional Logics (Q4291036) (← links)
- Herbrand's Theorem for Nonstandard Inference Operations (Q4291037) (← links)
- Conjunctive Normal Forms In Three-valued Propositional Logics (Q4291038) (← links)
- A Uniform Proof-theoretic Investigation of Linear Logic Programming (Q4291039) (← links)
- Rewrite-based Equational Theorem Proving with Selection and Simplification (Q4304492) (← links)
- Input/Output Dependencies of Normal Logic Programs (Q4304493) (← links)
- Expressiveness for Highly Nested Expressions in Linear Temporal Logic (Q4304494) (← links)
- Unforgettable Forgetful Determinacy (Q4304495) (← links)
- The Taming of the Cut. Classical Refutations with Analytic Cut (Q4304496) (← links)
- Letter (Q4305344) (← links)
- Logical Description of Monotone NP Problems (Q4305345) (← links)
- A Modal Approach to Negation as Failure Rule (Q4305346) (← links)
- About Boundedness for some Datalog and Datalog<sup>neg</sup> Programs (Q4305348) (← links)
- Linear Logic as CSP (Q4305350) (← links)
- Deduction in Concept Languages: from Subsumption to Instance Checking (Q4305351) (← links)
- ADL and the State-Transition Model of Action (Q4316292) (← links)
