The following pages link to (Q4229041):
Displaying 50 items.
- An interpretation of Łukasiewicz's 4-valued modal logic (Q263087) (← links)
- Revisiting da Costa logic (Q301378) (← links)
- A relational perspective of attribute reduction in rough set-based data analysis (Q421602) (← links)
- Relational semantics of the Lambek calculus extended with classical propositional logic (Q456962) (← links)
- Practical algorithms for MSO model-checking on tree-decomposable graphs (Q473216) (← links)
- Sets and functions in theoretical physics (Q488350) (← links)
- Classical negation and expansions of Belnap-Dunn logic (Q495842) (← links)
- Generalizing functional completeness in Belnap-Dunn logic (Q497416) (← links)
- Remarks on the theory of quasi-sets (Q609640) (← links)
- The quasi-lattice of indiscernible elements (Q631517) (← links)
- On existence in set theory (Q691129) (← links)
- Characterizing programming systems allowing program self-reference (Q733737) (← links)
- Problems in epistemic space (Q742481) (← links)
- Finite axiomatizability of local set theory (Q764013) (← links)
- Labels for non-individuals? (Q812040) (← links)
- Correspondence analysis for some fragments of classical propositional logic (Q828774) (← links)
- Discrete semantics for hybrid automata. Avoiding misleading assumptions in systems biology (Q843992) (← links)
- Default theories over monadic languages (Q860840) (← links)
- Passive induction and a solution to a Paris-Wilkie open question (Q882120) (← links)
- Automated compositional proofs for real-time systems (Q882449) (← links)
- Some problems concerning language and physics (Q885517) (← links)
- A thread calculus with molecular dynamics (Q988554) (← links)
- Inclusion dynamics hybrid automata (Q999262) (← links)
- Full operational set theory with unbounded existential quantification and power set (Q1024551) (← links)
- Notions of sameness by default and their application to anaphora, vagueness, and uncertain reasoning (Q1024815) (← links)
- How to build a hypercomputer (Q1036529) (← links)
- Recognizing the Farey-Stern-Brocot AF algebra (Q1039874) (← links)
- Reverse mathematics and its meaning (Q1312709) (← links)
- Operational concepts of nonmonotonic logics. I: Default logic (Q1333283) (← links)
- Generalized correspondence analysis for three-valued logics (Q1632053) (← links)
- Use of logical models for proving infeasibility in term rewriting (Q1751429) (← links)
- Scaled aggregation operations over two- and three-dimensional index matrices (Q1800299) (← links)
- Probability and logic in belief systems (Q1846416) (← links)
- Symmetries of knowledge bases (Q1926585) (← links)
- Quasigraphs and skeletal partitions (Q2080216) (← links)
- Wave-particle duality and the objectiveness of ``true'' and ``false'' (Q2241464) (← links)
- A diagrammatic calculus of syllogisms (Q2255199) (← links)
- Proving semantic properties as first-order satisfiability (Q2289018) (← links)
- Using well-founded relations for proving operational termination (Q2303238) (← links)
- Algebraic approach to algorithmic logic (Q2344192) (← links)
- Generality's price: Inescapable deficiencies in machine-learned programs (Q2368918) (← links)
- On confluence and residuals in Cauchy convergent transfinite rewriting (Q2390300) (← links)
- Conditionals in theories of truth (Q2410892) (← links)
- Same same but different: an alphabetically innocent compositional predicate logic (Q2410894) (← links)
- Decision theory with prospect interference and entanglement (Q2429998) (← links)
- Satisfiability in composition-nominative logics (Q2445092) (← links)
- Closure-based constraints in formal concept analysis (Q2446833) (← links)
- \(\epsilon\)-semantics computations on biological systems (Q2453211) (← links)
- A generalization of the second incompleteness theorem and some exceptions to it (Q2500470) (← links)
- On one of Specker's theorems (Q2691875) (← links)
