Pages that link to "Item:Q3992552"

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

Displaying 50 items.

• Coalgebra and abstraction (Q1981994) (← links)
• Adding the power-set to description logics (Q1989328) (← links)
• Structural relativity and informal rigour (Q2080583) (← links)
• Hennessy-Milner and van Benthem for instantial neighbourhood logic (Q2144186) (← links)
• A remark on probabilistic measures of coherence (Q2176410) (← links)
• Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
• On Bourbaki's axiomatic system for set theory (Q2263057) (← links)
• A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\) (Q2344720) (← links)
• The inclosure scheme and the solution to the paradoxes of self-reference (Q2475296) (← links)
• Forcing and antifoundation (Q2486987) (← links)
• Distributive laws for the coinductive solution of recursive equations (Q2495644) (← links)
• Final coalgebras for functors on measurable spaces (Q2495647) (← links)
• Terminal coalgebras and free iterative theories (Q2500475) (← links)
• Processes as formal power series: a coinductive approach to denotational semantics (Q2503337) (← links)
• On final coalgebras of power-set functors and saturated trees (Q2516577) (← links)
• Final coalgebras and the Hennessy-Milner property (Q2576941) (← links)
• Undirecting membership in models of anti-foundation (Q2662895) (← links)
• Hennessy-Milner properties via topological compactness (Q2672663) (← links)
• Logic, spatial algorithms and visual reasoning (Q2688866) (← links)
• Kripke-Platek set theory and the anti-foundation axiom (Q2765565) (← links)
• On rational monads and free iterative theories (Q2842813) (← links)
• Well-quasi-ordering hereditarily finite sets (Q2855754) (← links)
• Equivalences and congruences on infinite Conway games (Q2889179) (← links)
• Paradox, ZF, and the Axiom of Foundation (Q2909755) (← links)
• Computing the Maximum Bisimulation with Spiking Neural P Systems (Q3009343) (← links)
• Qal wa- omer and Theory of Massive-Parallel Proofs (Q3019780) (← links)
• On the Definability of Simulability and Bisimilarity by Finite Epistemic Models (Q3092294) (← links)
• Forcing with the Anti-Foundation axiom (Q3117780) (← links)
• (Q3121528) (← links)
• Bisimulations Generated from Corecursive Equations (Q3178257) (← links)
• (Q3204456) (← links)
• How to Reason Coinductively Informally (Q3305562) (← links)
• An Ordered Category of Processes (Q3498427) (← links)
• ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’ (Q3580674) (← links)
• An Application of Non‐Wellfounded Sets to the Foundations of Geometry (Q3989275) (← links)
• On coalgebra of real numbers (Q4256314) (← links)
• Processes as terms: non-well-founded models for bisimulation (Q4279257) (← links)
• Graham Priest's Mathematical Analysis of the Concept of Emptiness (Q4608213) (← links)
• Extending set functors to generalised metric spaces (Q4625693) (← links)
• An application of co-inductive types in Coq: Verification of the alternating bit protocol (Q4647576) (← links)
• TRUTHS, INDUCTIVE DEFINITIONS, AND KRIPKE-PLATEK SYSTEMS OVER SET THEORY (Q4692072) (← links)
• <i>μ</i>-Bicomplete Categories and Parity Games (Q4787834) (← links)
• Vier Philosophen über semantische Paradoxien (Q4870005) (← links)
• Ordinal operations on graph representations of sets (Q4915216) (← links)
• Rank-Based Symbolic Bisimulation (Q4916208) (← links)
• A Coalgebraic View of Infinite Trees and Iteration (Q4917030) (← links)
• Modal Rules are Co-Implications (Q4917041) (← links)
• Elements of Stream Calculus (Q4917066) (← links)
• Non‐well‐founded extensions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbf {V}$\end{document} (Q4928967) (← links)
• On a graph connecting hyperbinary expansions (Q4985650) (← links)