The following pages link to (Q3992552):
Displaying 50 items.
- The coinductive resumption monad (Q283770) (← links)
- Relation lifting, a survey (Q299182) (← links)
- Relating first-order set theories, toposes and categories of classes (Q386623) (← links)
- Proof systems for Moss' coalgebraic logic (Q402120) (← links)
- Knowledge representation, the world wide web, and the evolution of logic (Q408317) (← links)
- Modalities in the Stone age: a comparison of coalgebraic logics (Q418820) (← links)
- A Tractarian universe (Q452345) (← links)
- Relatively terminal coalgebras (Q456862) (← links)
- Refinement modal logic (Q476194) (← links)
- Starting from the scenario Euclid-Bolyai-Einstein (Q514578) (← links)
- On the final sequence of a finitary set functor (Q557796) (← links)
- Iteration one more time (Q558731) (← links)
- The strength of extensionality. II: Weak weak set theories without infinity (Q639665) (← links)
- Formal semantics for mutual belief (Q685541) (← links)
- Well- and non-well-founded Fregean extensions (Q704031) (← links)
- A single-sorted theory of multisets (Q740200) (← links)
- The graph conception of set (Q742483) (← links)
- Non-well-founded sets modeled as ideal fixed points (Q757360) (← links)
- A tableau-based decision procedure for a fragment of set theory with iterated membership (Q812437) (← links)
- Control of discrete-event systems with partial observations using coalgebra and coinduction (Q816696) (← links)
- Mathematical foundations of consciousness (Q846525) (← links)
- The category-theoretic solution of recursive program schemes (Q860876) (← links)
- Non-well-founded trees in categories (Q876383) (← links)
- Multigames and strategies, coalgebraically (Q890378) (← links)
- A synthetic axiomatization of map theory (Q906269) (← links)
- Type inference for polymorphic references (Q918190) (← links)
- Dynamics of mental activity (Q975882) (← links)
- The strength of extensionality. I: Weak weak set theories with infinity (Q1006617) (← links)
- Ordinal analysis by transformations (Q1006618) (← links)
- A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets (Q1006642) (← links)
- Combination of constraint solvers for free and quasi-free structures (Q1127338) (← links)
- Terminal metric spaces of finitely branching and image finite linear processes (Q1128985) (← links)
- A fixpoint approach to finite delay and fairness (Q1129259) (← links)
- Co-induction in relational semantics (Q1177158) (← links)
- Logical feedback (Q1181485) (← links)
- Hypersets (Q1181863) (← links)
- Map theory (Q1193653) (← links)
- Declarative operations on nets (Q1202674) (← links)
- Topology, domain theory and theoretical computer science (Q1295216) (← links)
- Coalgebraic logic (Q1295427) (← links)
- Hereditarily-finite sets, data bases and polynomial-time computability (Q1311973) (← links)
- Experimenting with Isabelle in ZF set theory (Q1312157) (← links)
- On plural reference and elementary set theory (Q1313373) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- Defining concurrent processes constructively (Q1314421) (← links)
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\) (Q1318721) (← links)
- Set theory for verification. I: From foundations to functions (Q1319386) (← links)
- A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets (Q1322849) (← links)
- Dynamic semantics and circular propositions (Q1325775) (← links)
- Non-well-founded sets via revision rules (Q1337508) (← links)
