The following pages link to (Q3328538):
Displaying 22 items.
- Studying equivalences of transition systems with algebraic tools (Q673968) (← links)
- The graph conception of set (Q742483) (← links)
- Non-well-founded trees in categories (Q876383) (← links)
- Multigames and strategies, coalgebraically (Q890378) (← links)
- A characterization of internal sets (Q1262312) (← links)
- Relative consistency of the general axiom of superuniversality for sets, \(n\)-tuples and operations (Q1312954) (← links)
- Set-theoretical and other elementary models of the \(\lambda\)-calculus (Q1314361) (← links)
- A general construction of hyperuniverses (Q1351794) (← links)
- A computable expression of closure to efficient causation (Q1617623) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Common knowledge: Relating anti-founded situation semantics to modal logic neighbourhood semantics (Q1895975) (← links)
- Choice principles in hyperuniverses (Q1919525) (← links)
- Model theory of XPath on data trees. II: Binary bisimulation and definability (Q2401631) (← links)
- Undirecting membership in models of anti-foundation (Q2662895) (← links)
- Conway Games, Coalgebraically (Q2888495) (← links)
- Equivalences and Congruences on Infinite Conway Games (Q2889179) (← links)
- Forcing with the Anti-Foundation axiom (Q3117780) (← links)
- THE ITERATIVE CONCEPTION OF SET (Q3580662) (← links)
- Non‐well‐founded extensions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbf {V}$\end{document} (Q4928967) (← links)
- ON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATION (Q5884258) (← links)
- Characterization and computation of approximate bisimulations for fuzzy automata (Q6079413) (← links)
- Is weak supplementation analytic? (Q6088917) (← links)
