The following pages link to Journal Of Logic And Computation (Q2983390):
Displaying 50 items.
- Synthesizing Monadic Predicates (Q3549312) (← links)
- The Expansion Problem in Lambda Calculi with Explicit Substitution (Q3549313) (← links)
- Complete Axiomatization of Discrete-Measure Almost-Everywhere Quantification (Q3549314) (← links)
- Logical Weak Completions of Paraconsistent Logics (Q3549315) (← links)
- On Computational Complexity of Semilinear Varieties (Q3549316) (← links)
- Standard Logics Are Valuation-Nonmonotonic (Q3549317) (← links)
- Cirquent Calculus Deepened (Q3549318) (← links)
- On Dynamic Topological Logic of the Real Line (Q3549319) (← links)
- On Algebras with Iteration (Q3549320) (← links)
- On White's Expansion of Lukasiewicz Logic (Q3553914) (← links)
- Arithmetical Complexity of First-order Predicate Fuzzy Logics Over Distinguished Semantics (Q3553915) (← links)
- Admissible Rules of Lukasiewicz Logic (Q3553916) (← links)
- A Proof System for Abstract Non-interference (Q3553917) (← links)
- The Complexity of the Warranted Formula Problem in Propositional Argumentation (Q3553918) (← links)
- A Nominal Axiomatization of the Lambda Calculus (Q3553919) (← links)
- Answer Set Programming with Resources (Q3553920) (← links)
- Paraconsistent Machines and their Relation to Quantum Computing (Q3553921) (← links)
- Completeness and Cut-elimination in the Intuitionistic Theory of Types--Part 2 (Q3553922) (← links)
- Reliable Methods of Judgement Aggregation (Q3553923) (← links)
- The Logic of Quasi-MV Algebras (Q3553924) (← links)
- Comparing LTL Semantics for Runtime Verification (Q3569195) (← links)
- Rule Systems for Run-time Monitoring: from EAGLE to RULER (Q3569196) (← links)
- Collaborative Runtime Verification with Tracematches (Q3569199) (← links)
- Temporal Assertions with Parametrized Propositions (Q3569200) (← links)
- Constructive Logic with Strong Negation as a Substructural Logic (Q3583096) (← links)
- Categorical Equivalences for Formula quasi-MV Algebras (Q3583097) (← links)
- Finitely Presented MV-algebras with Finite Automorphism Group (Q3583098) (← links)
- Interpolation Properties, Beth Definability Properties and Amalgamation Properties for Substructural Logics (Q3583099) (← links)
- Applying Universal Algebra to Lambda Calculus (Q3583100) (← links)
- Quantale Modules and their Operators, with Applications (Q3583101) (← links)
- Syllogistic Logics with Verbs (Q3583102) (← links)
- A Non-finitary Sentential Logic that is Elementarily Algebraizable (Q3583103) (← links)
- Solutions to Some Open Problems on Totally Ordered Monoids (Q3583104) (← links)
- K-Triviality of Closed Sets and Continuous Functions (Q3611719) (← links)
- RZ: a Tool for Bringing Constructive and Computable Mathematics Closer to Programming Practice (Q3611720) (← links)
- Borel Complexity of Topological Operations on Computable Metric Spaces (Q3611721) (← links)
- Pseudojumps and Formula Classes (Q3611722) (← links)
- Subexponential Time and Fixed-parameter Tractability: Exploiting the Miniaturization Mapping (Q3611723) (← links)
- Existentially Closed Models and Conservation Results in Bounded Arithmetic (Q3611724) (← links)
- The Settling Time Reducibility Ordering and Formula Sets (Q3611725) (← links)
- Enumeration Degrees and Enumerability of Familes (Q3611726) (← links)
- The Uniformity Principle for -definability (Q3611727) (← links)
- Infinite Computations and a Hierarchy in 3 Reconsidered (Q3611728) (← links)
- Undecidability in Some Structures Related to Computation Theory (Q3611729) (← links)
- A Jump Inversion Theorem for the Degree Spectra (Q3611730) (← links)
- Logical and Complexity-theoretic Aspects of Models of Computation with Restricted Access to Arrays (Q3611731) (← links)
- Complexity Issues in Axiomatic Extensions of Lukasiewicz Logic (Q3623218) (← links)
- Paramodulation with Well-founded Orderings (Q3623219) (← links)
- Algebras of Relations and Relevance Logic (Q3623220) (← links)
- Proof Complexity of the Cut-free Calculus of Structures (Q3623221) (← links)
