The following pages link to (Q5812175):
Displaying 50 items.
- Incomplete symbols -- definite descriptions revisited (Q253123) (← links)
- A framework for compositional verification of multi-valued systems via abstraction-refinement (Q259065) (← links)
- On hyperarithmetical realizability (Q268079) (← links)
- Informational semantics, non-deterministic matrices and feasible deduction (Q281148) (← links)
- On all strong Kleene generalizations of classical logic (Q295922) (← links)
- Arithmetical realizability and basic logic (Q297665) (← links)
- Nice embedding in classical logic (Q300555) (← links)
- Correia semantics revisited (Q300562) (← links)
- The Lambek calculus extended with intuitionistic propositional logic (Q332086) (← links)
- Hypersequent rules with restricted contexts for propositional modal logics (Q344801) (← links)
- Editors' introduction: The third life of quantum logic: Quantum logic inspired by quantum computing (Q358690) (← links)
- On truth-gaps, bipolar belief and the assertability of vague propositions (Q359975) (← links)
- The paraconsistent logic of quantum superpositions (Q365767) (← links)
- Different senses of finitude: an inquiry into Hilbert's finitism (Q375340) (← links)
- A short proof of Glivenko theorems for intermediate predicate logics (Q377463) (← links)
- Does the deduction theorem fail for modal logic? (Q383061) (← links)
- Three-valued logics in modal logic (Q383567) (← links)
- The FE-closure operator in countable-valued logic (Q384749) (← links)
- Semantics and proof-theory of depth bounded Boolean logics (Q385021) (← links)
- Intuitionistic completeness of first-order logic (Q392280) (← links)
- Abstract Hilbertian deductive systems, infon logic, and Datalog (Q393078) (← links)
- Gradualness, uncertainty and bipolarity: making sense of fuzzy sets (Q419038) (← links)
- Closed choice and a uniform low basis theorem (Q424541) (← links)
- Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra (Q424551) (← links)
- Sequential and distributed on-the-fly computation of weak tau-confluence (Q436408) (← links)
- A bipolar model of vague concepts based on random set and prototype theory (Q448956) (← links)
- Some axioms for constructive analysis (Q453178) (← links)
- Constructive Boolean circuits and the exactness of timed ternary simulation (Q453539) (← links)
- Relational semantics of the Lambek calculus extended with classical propositional logic (Q456962) (← links)
- Editorial: Weighted logics for artificial intelligence -- an introductory discussion (Q465578) (← links)
- Borderline vs. unknown: comparing three-valued representations of imperfect information (Q465586) (← links)
- On truth-gaps, truth-gluts, and bipolar propositions (Q473380) (← links)
- Characterizations of semicomputable sets of real numbers (Q478399) (← links)
- A constructive version of Tarski's geometry (Q490871) (← links)
- Pragmatic interpretations of vague expressions: strongest meaning and nonmonotonic consequence (Q496321) (← links)
- A map of dependencies among three-valued logics (Q497633) (← links)
- Decision-theoretic three-way approximations of fuzzy sets (Q506359) (← links)
- A three-way approach for learning rules in automatic knowledge-based topic models (Q511656) (← links)
- Conflicting accounts of \(\lambda\)-definability (Q511925) (← links)
- Notes on computable analysis (Q519888) (← links)
- On paraconsistent weak Kleene logic: axiomatisation and algebraic analysis (Q526733) (← links)
- Theory of semi-instantiation in abstract argumentation (Q528522) (← links)
- On the simple substitution property for superintuitionistic and modal propositional logics (Q542292) (← links)
- On the algorithmic complexity of static structures (Q545415) (← links)
- CTRL: extension of CTL with regular expressions and fairness operators to verify genetic regulatory networks (Q548484) (← links)
- Fixing Zeno gaps (Q549197) (← links)
- Continuity of operators on continuous and discrete time streams (Q549207) (← links)
- A theorem on the consistency of circumscription (Q578934) (← links)
- Tarski's theory of definability: Common themes in descriptive set theory, recursive function theory, classical pure logic, and finite-universe logic (Q598270) (← links)
- What is the world of mathematics? (Q598279) (← links)
