Pages that link to "Item:Q3992552"

The following pages link to Non-well-founded sets. Foreword by Jon Barwise (Q3992552):

Displaying 50 items.

• CHARACTERIZING EXISTENCE OF A MEASURABLE CARDINAL VIA MODAL LOGIC (Q5000268) (← links)
• Applications of type theory (Q5044747) (← links)
• Convenient category of processes and simulations I: Modulo strong bisimilarity (Q5057463) (← links)
• Relational set theory (Q5057465) (← links)
• Bisimulation as a logical relation (Q5058364) (← links)
• Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice (Q5060191) (← links)
• Rough and Near: Modal History of Two Theories (Q5082210) (← links)
• Algebras of UTxO blockchains (Q5084313) (← links)
• (Q5087788) (← links)
• A final coalgebra theorem (Q5096269) (← links)
• Mongruences and cofree coalgebras (Q5096389) (← links)
• Processes and hyperuniverses (Q5096893) (← links)
• Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922) (← links)
• Modelling Multi-Agent Epistemic Planning in ASP (Q5140002) (← links)
• A fixedpoint approach to implementing (Co)inductive definitions (Q5210768) (← links)
• Game characterizations and lower cones in the Weihrauch degrees (Q5228881) (← links)
• Situation Theory Reconsidered (Q5249694) (← links)
• Coalgebras as Types Determined by Their Elimination Rules (Q5253935) (← links)
• Simplified Coalgebraic Trace Equivalence (Q5256339) (← links)
• Nonsets (Q5258980) (← links)
• Smooth coalgebra: testing vector analysis (Q5361142) (← links)
• Practical coinduction (Q5361147) (← links)
• EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE (Q5401599) (← links)
• Why Sets? (Q5452179) (← links)
• (Q5875411) (← links)
• Final semantics for a higher order concurrent language (Q5878904) (← links)
• ON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATION (Q5884258) (← links)
• Final universes of processes (Q5890039) (← links)
• Three metric domains of processes for bisimulation (Q5890043) (← links)
• Goals and benchmarks for automated map reasoning (Q5927984) (← links)
• Sets and classes as many (Q5928926) (← links)
• Antifoundation and transitive closure in the system of Zermelo (Q5937852) (← links)
• A coalgebraic presentation of structured transition systems (Q5941158) (← links)
• On the structure of categories of coalgebras (Q5941161) (← links)
• Parametric corecursion (Q5941163) (← links)
• The strength of Mac Lane set theory (Q5946048) (← links)
• Combination of constraint systems II: Rational amalgamation (Q5958755) (← links)
• Bisimulation and propositional intuitionistic logic (Q6044128) (← links)
• A concrete final coalgebra theorem for ZF set theory (Q6061877) (← links)
• Codifying guarded definitions with recursive schemes (Q6083895) (← links)
• Is weak supplementation analytic? (Q6088917) (← links)
• Nonwellfounded sets and programming language semantics (Q6116571) (← links)
• WHAT IS A RESTRICTIVE THEORY? (Q6131223) (← links)
• Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version (Q6156642) (← links)
• A new model construction by making a detour via intuitionistic theories. IV: A closer connection between \(\mathrm{KP} \omega\) and \(\mathrm{BI}\). (Q6539428) (← links)
• \textsc{delphic}: practical DEL planning via possibilities (Q6545564) (← links)
• Decidability results in automata and process theory (Q6560390) (← links)
• Sets with dependent elements: a formalization of Castoriadis' notion of magma (Q6597126) (← links)
• Reasoning on relations, modalities, and sets (Q6599612) (← links)
• Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers (Q6612803) (← links)