The following pages link to Journal Of Logic And Computation (Q2983390):
Displaying 50 items.
- Relations Versus Functions at the Foundations of Logic: Type-Theoretic Considerations (Q3006121) (← links)
- Preservation by fibring of the finite model property (Q3006122) (← links)
- On States on MV-algebras and their Applications (Q3006595) (← links)
- On the Logical Formalization of Possibilistic Counterparts of States over n-valued Lukasiewicz Events (Q3006596) (← links)
- Models for Many-Valued Probabilistic Reasoning (Q3006597) (← links)
- States on Bold Algebras: Categorical Aspects (Q3006598) (← links)
- Core of Coalition Games on MV-algebras (Q3006599) (← links)
- Metric Completions of MV-algebras with States: An Approach to Stochastic Independence (Q3006600) (← links)
- A Compact [0,1]-valued First-order Lukasiewicz Logic with Identity on Hilbert Space (Q3006601) (← links)
- Measures and Topologies on MV-algebras (Q3006602) (← links)
- Normal Forms for Characteristic Functions on n-ary Relations (Q3025326) (← links)
- Records and Record Types in Semantic Theory (Q3025327) (← links)
- Abstraction and Ontology: Questions as Propositional Abstracts in Type Theory with Records (Q3025329) (← links)
- Underspecified Interpretations in a Curry-typed Representation Language (Q3025330) (← links)
- Semantics and Stratification (Q3025331) (← links)
- Probabilistic -calculus and Quantitative Program Analysis (Q3025332) (← links)
- Quantitative Information Flow, Relations and Polymorphic Types (Q3025333) (← links)
- Director Strings Revisited: A Generic Approach to the Efficient Representation of Free Variables in Higher-order Rewriting (Q3025334) (← links)
- Interaction Net Implementation of Additive and Multiplicative Structures (Q3025335) (← links)
- Non-deterministic Multiple-valued Structures (Q3025337) (← links)
- Preferential and Preferential-discriminative Consequence Relations (Q3025338) (← links)
- Programming and Verifying Subgame-Perfect Mechanisms (Q3025339) (← links)
- A Verification Logic for Rewriting Logic (Q3025340) (← links)
- On Long Normal Inhabitants of a Type (Q3025341) (← links)
- Towards a Systematic Account of Different Semantics for Logic Programs (Q3025342) (← links)
- Coalgebra and Logic: A Brief Overview (Q3056294) (← links)
- Presentation of Set Functors: A Coalgebraic Perspective (Q3056295) (← links)
- Vietoris Bisimulations (Q3056296) (← links)
- Exemplaric Expressivity of Modal Logics (Q3056297) (← links)
- Deduction Systems for Coalgebras Over Measurable Spaces (Q3056298) (← links)
- A Note on Expressive Coalgebraic Logics for Finitary Set Functors (Q3056299) (← links)
- Rank-1 Modal Logics are Coalgebraic (Q3056300) (← links)
- Bases of Admissible Rules of Lukasiewicz Logic (Q3069724) (← links)
- Completeness by Forcing (Q3069725) (← links)
- Interrogatives, Recursion, and Incompleteness (Q3069726) (← links)
- Intuitionistic Trilattice Logics (Q3069727) (← links)
- Information About a Given Entity: From Semantics Towards Automated Deduction (Q3069728) (← links)
- Role Interchange for Anonymity and Privacy of Voting (Q3069729) (← links)
- Parallel SAT Solving in Bounded Model Checking (Q3069995) (← links)
- Distributed Algorithms for SCC Decomposition (Q3069996) (← links)
- A Database Approach to Distributed State-Space Generation (Q3069997) (← links)
- Speculative Image Computation for Distributed Symbolic Reachability Analysis (Q3069998) (← links)
- To Parallelize or to Optimize? (Q3069999) (← links)
- Can We Make the Second Incompleteness Theorem Coordinate Free? (Q3094141) (← links)
- Intuitionistic Dual-intuitionistic Nets (Q3094142) (← links)
- From Deep Inference to Proof Nets via Cut Elimination (Q3094143) (← links)
- Eskolemization in Intuitionistic Logic (Q3094144) (← links)
- On Two Attempts of Describing Propositional Realizability Logic (Q3094145) (← links)
- Arithmetical Completeness of the Intuitionistic Logic of Proofs (Q3094147) (← links)
- A Topological Study of the Closed Fragment of GLP (Q3094148) (← links)
