scientific article
From MaRDI portal
Publication:3328538
zbMath0541.03032MaRDI QIDQ3328538
Publication date: 1983
Full work available at URL: http://www.numdam.org/item?id=ASNSP_1983_4_10_3_493_0
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
ON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATION, A computable expression of closure to efficient causation, Conway Games, Coalgebraically, Equivalences and Congruences on Infinite Conway Games, A structural co-induction theorem, An efficient algorithm for computing bisimulation equivalence, Common knowledge: Relating anti-founded situation semantics to modal logic neighbourhood semantics, A general construction of hyperuniverses, Model theory of XPath on data trees. II: Binary bisimulation and definability, Choice principles in hyperuniverses, Non-well-founded trees in categories, Undirecting membership in models of anti-foundation, Processes and hyperuniverses, Multigames and strategies, coalgebraically, How to Choose New Axioms for Set Theory?, Characterization and computation of approximate bisimulations for fuzzy automata, Is weak supplementation analytic?, Game characterizations and lower cones in the Weihrauch degrees, Studying equivalences of transition systems with algebraic tools, THE ITERATIVE CONCEPTION OF SET, Antifoundation and transitive closure in the system of Zermelo, Non‐well‐founded extensions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbf {V}$\end{document}, The graph conception of set, A characterization of internal sets, Forcing with the Anti-Foundation axiom, Relative consistency of the general axiom of superuniversality for sets, \(n\)-tuples and operations, Set-theoretical and other elementary models of the \(\lambda\)-calculus, Final semantics for a higher order concurrent language
Cites Work
