The following pages link to (Q3959414):
Displayed 50 items.
- A context for belief revision: forward chaining-normal nonmonotonic rule systems (Q1326782) (← links)
- Spectral sets (Q1330687) (← links)
- Annotations in formal specifications and proofs (Q1334901) (← links)
- Synchronization trees (Q1348524) (← links)
- Linear time and branching time semantics for recursion with merge (Q1348527) (← links)
- Algebraic domains of natural transformations (Q1349657) (← links)
- Adequacy for a lazy functional language with recursive and polymorphic types (Q1349683) (← links)
- Constructive domain theory as a branch of intuitionistic pointfree topology (Q1350507) (← links)
- On completeness theorems for feature logics (Q1353907) (← links)
- Liminf convergence in \(\Omega\)-categories (Q1390934) (← links)
- Defaults in domain theory (Q1391866) (← links)
- The presence of lattice theory in discrete problems of mathematical social sciences. Why. (Q1414820) (← links)
- A note on injective spaces. (Q1426505) (← links)
- Probabilistic argumentation systems. A new way to combine logic with probability. (Q1427350) (← links)
- Computational topology: Ambient isotopic approximation of 2-manifolds. (Q1427770) (← links)
- Ideal models of spaces. (Q1427784) (← links)
- Some points in formal topology. (Q1427787) (← links)
- Behavioural inverse limit \(\lambda\)-models (Q1434350) (← links)
- Domain theory for concurrency (Q1434357) (← links)
- Presenting locale pullback via directed complete posets (Q1434361) (← links)
- Entailment systems for stably locally compact locales (Q1434362) (← links)
- From computation to foundations via functions and application: The \(\lambda\)-calculus and its webbed models (Q1583485) (← links)
- Notions from rough set theory in a generalized dependency relation context (Q1644893) (← links)
- Weak algebraic information systems and a new equivalent category of DOM of domains (Q1727992) (← links)
- On Scott's thesis for domains of information and well-quasi-orderings (Q1813971) (← links)
- Continuously generated fixed points (Q1823004) (← links)
- Recursive domain equations for concrete data structure (Q1823005) (← links)
- Describing semantic domains with sprouts (Q1823713) (← links)
- Domain theoretic models of polymorphism (Q1824612) (← links)
- Building continuous webbed models for system F (Q1826624) (← links)
- A cartesian closed category in Martin-Löf's intuitionistic type theory (Q1853587) (← links)
- Discrimination by parallel observers: the algorithm. (Q1854269) (← links)
- Relational interpretations of recursive types in an operational setting. (Q1854316) (← links)
- Toward an infinitary logic of domains: Abramsky logic for transition systems (Q1854320) (← links)
- A timed concurrent constraint language. (Q1854359) (← links)
- Clausal logic and logic programming in algebraic domains (Q1854478) (← links)
- Three dual ontologies (Q1868336) (← links)
- Topological games in domain theory (Q1873728) (← links)
- Infinite intersection types (Q1887155) (← links)
- Towards the computational complexity of \(\mathcal{PR}^ \omega\)-terms (Q1899150) (← links)
- Recursive topological spaces (Q1921850) (← links)
- A type theoretic interpretation of constructive domain theory (Q1923827) (← links)
- New perspectives of granular computing in relation geometry induced by pairings (Q2000596) (← links)
- Directed complete poset congruences (Q2001384) (← links)
- A general framework for FDE-based modal logics (Q2027214) (← links)
- Rough games modeled via \(L\)-fuzzy ambiguous representations of semilattices (Q2035291) (← links)
- A category of quantum posets (Q2088113) (← links)
- Bounded complete domains and their logical form (Q2105444) (← links)
- Information systems for continuous semi-lattices (Q2123056) (← links)
- Intuitionistic fixed point logic (Q2220485) (← links)