The following pages link to Journal Of Logic And Computation (Q2983390):
Displaying 50 items.
- Embedding from multilattice logic into classical logic and vice versa (Q3133174) (← links)
- Implicit Kripke semantics and ultraproducts in stratified institutions (Q3133175) (← links)
- Categorical comprehensions and recursion (Q3133177) (← links)
- Algebras of Information States (Q3133178) (← links)
- Universal logic and computation (Q3133179) (← links)
- Combinatorics of $\lambda$-terms: a natural approach (Q3133181) (← links)
- How to identify, translate and combine logics? (Q3133182) (← links)
- An institutional approach to positive coalgebraic logic (Q3133183) (← links)
- Paraconsistency in hybrid logic (Q3133184) (← links)
- Polynomial ring calculus for modalities (Q3133185) (← links)
- Fair decomposition of group obligations (Q3133187) (← links)
- On the characterization of fibred logics, with applications to conservativity and finite-valuedness (Q3133188) (← links)
- Argument Revision (Q3133190) (← links)
- One-step Heyting Algebras and Hypersequent Calculi with the Bounded Proof Property (Q3133191) (← links)
- The IMP game: Learnability, approximability and adversarial learning beyond $\Sigma^0_1$ (Q3133192) (← links)
- On the likelihood of normalization in combinatory logic (Q3133193) (← links)
- Relating first-order monadic omega-logic, propositional linear-time temporal logic, propositional generalized definitional reflection logic and propositional infinitary logic (Q3133194) (← links)
- Verifying Concurrent Systems with Symbolic Execution (Q3146300) (← links)
- On the Relationship between -automata and Temporal Logic Normal Forms (Q3146301) (← links)
- Linear Tense Logics of Increasing Sets (Q3146302) (← links)
- Extending CTL with Actions and Real Time (Q3146303) (← links)
- Model Checking Games for Branching Time Logics (Q3146304) (← links)
- Extending Kamp's Theorem to Model Time Granularity (Q3146305) (← links)
- A formal analysis of the role of argumentation in negotiation dialogues (Q3165749) (← links)
- Using argumentation to reason about trust and belief (Q3165750) (← links)
- Revising option status in argument-based decision systems1 (Q3165751) (← links)
- Temporal Logics of Repeating Values (Q3165752) (← links)
- Embedding-based approaches to paraconsistent and temporal description logics (Q3165753) (← links)
- Expressible preferential logics (Q3165754) (← links)
- Complexity Classifications for Propositional Abduction in Post's Framework (Q3165755) (← links)
- Cut Elimination and Realization for Epistemic Logics with Justification (Q3165756) (← links)
- Writing out Unifiers in Linear Temporal Logic (Q3165757) (← links)
- Semi-stable semantics (Q3165758) (← links)
- Base Revision for Ontology Debugging (Q3184231) (← links)
- On Instance-level Update and Erasure in Description Logic Ontologies (Q3184232) (← links)
- Trust-based Revision for Expressive Web Syndication (Q3184233) (← links)
- Category-based Equational Reasoning: An Approach to Ontology Integration (Q3184234) (← links)
- Reasoning Support for Mapping Revision (Q3184237) (← links)
- A Multi-Agent System for Dynamic Ontologies (Q3184242) (← links)
- Multimedia Interpretation for Dynamic Ontology Evolution (Q3184249) (← links)
- Preference-based argumentation built from prioritized logic programming (Q3195612) (← links)
- Implementing crash-resistance and non-interference in logic-based argumentation (Q3195614) (← links)
- Formal semantics for perceptual classification (Q3195615) (← links)
- Using synchronous tree adjoining grammar to model the typology of bound variable pronouns (Q3195617) (← links)
- A small model theorem for the hybrid -calculus (Q3195619) (← links)
- Representing supererogation (Q3195620) (← links)
- Residuated Park theories (Q3195621) (← links)
- Quantifiers in logic and proof-search using permissive-nominal terms and sets (Q3195622) (← links)
- A Proof-Theoretic Approach to Logic Programming. I. Clauses as Rules (Q3210889) (← links)
- A Fixpoint Semantics for Ordered Logic (Q3210906) (← links)
