The following pages link to Journal Of Logic And Computation (Q2983390):
Displaying 50 items.
- A Remark on Superintuitionistic Predicate Logics of Kripke Frames with Constant and with Nested Domains (Q3094149) (← links)
- On the Structure of Finite Integral Commutative Residuated Chains (Q3097866) (← links)
- Structural Description of a Class of Involutive Uninorms via Skew Symmetrization (Q3097867) (← links)
- On the Minimum Many-Valued Modal Logic over a Finite Residuated Lattice (Q3097868) (← links)
- Computing Minimal Axiomatizations in Godel Propositional Logic (Q3097869) (← links)
- A Simple Proof of Completeness and Cut-admissibility for Propositional Godel Logic (Q3097870) (← links)
- Comments on Interpretability and Decidability in Fuzzy Logic (Q3097871) (← links)
- A Notion of Coherence for Books on Conditional Events in Many-valued Logic (Q3097872) (← links)
- Codd's Relational Model from the Point of View of Fuzzy Logic (Q3097873) (← links)
- State smearing theorems and the existence of states on some atomic lattice effect algebras (Q3103972) (← links)
- Social choice and the logic of simple games (Q3103973) (← links)
- Logic for coalitions with bounded resources (Q3103974) (← links)
- Non-axiomatizability for the linear temporal logic of knowledge with concrete observability (Q3103975) (← links)
- Metalevel argumentation (Q3103976) (← links)
- Public communication in justification logic (Q3103977) (← links)
- Cover semantics for quantified lax logic (Q3103978) (← links)
- Two new homomorphism dualities and lattice operations (Q3103979) (← links)
- Labelled natural deduction for a bundled branching temporal logic (Q3103980) (← links)
- Probabilistic models for intuitionistic predicate logic (Q3103981) (← links)
- Sequent calculi for induction and infinite descent (Q3103982) (← links)
- Verifying social expectations by model checking truncated paths (Q3103983) (← links)
- Computing inconsistency measure based on paraconsistent semantics (Q3103984) (← links)
- On the connections between $wtt$- and $Q$-reducibilities (Q3120202) (← links)
- Diffusion in social networks with recalcitrant agents (Q3120203) (← links)
- Discrete duality for lattices with modal operators (Q3120204) (← links)
- An analysis of clausal coordination using synchronous tree adjoining grammar (Q3120208) (← links)
- Maximality in finite-valued Łukasiewicz logics defined by order filters (Q3120209) (← links)
- Trial and error mathematics: Dialectical systems and completions of theories (Q3120211) (← links)
- Subframization and stabilization for superintuitionistic logics (Q3120212) (← links)
- Computing prime implicates by pruning the search space and accelerating subsumption (Q3133151) (← links)
- Completeness for linear continuous logic (Q3133153) (← links)
- Equivalence closure in the two-variable guarded fragment (Q3133154) (← links)
- The first-order hypothetical logic of proofs (Q3133155) (← links)
- Implementing Courcelle's Theorem in a declarative framework for dynamic programming (Q3133156) (← links)
- Partial order reduction for checking LTL formulae with the next-time operator (Q3133158) (← links)
- AGM contraction is not reconstructible as a descriptor operation (Q3133159) (← links)
- Complete representation by partial functions for composition, intersection and anti-domain (Q3133160) (← links)
- Suppes-style sequent calculus for probability logic (Q3133161) (← links)
- Limit-agreeing to disagree <xref ref-type="fn" rid="FN14">*</xref> (Q3133162) (← links)
- Knowledge in communication networks (Q3133163) (← links)
- A logic of sights (Q3133164) (← links)
- A minimalistic many-valued theory of types (Q3133165) (← links)
- Modal independence logic: (Q3133166) (← links)
- A bimodal perspective on possibility semantics (Q3133167) (← links)
- Gödel–Rosser's Incompleteness Theorem, generalized and optimized for definable theories (Q3133168) (← links)
- Undecidability of the transitive graded modal logic with converse (Q3133169) (← links)
- A Substructural Modal Logic of Utility (Q3133170) (← links)
- The power of primitive positive definitions with polynomially many variables (Q3133171) (← links)
- Comparing the expressiveness of argumentation semantics (Q3133172) (← links)
- Logics with definitional reflection rules (Q3133173) (← links)
