scientific article; zbMATH DE number 952378
From MaRDI portal
Publication:4717366
graphssemantic paradoxescorecursiongamescircularitystreamsself-referencehypersetsantifoundation axiomnon-wellfounded setsnonstandard set theorygreatest fixed pointsuniform operators
Philosophical and critical aspects of logic and foundations (03A05) Discrete mathematics in relation to computer science (68R99) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Philosophy of mathematics (00A30) Nonclassical and second-order set theories (03E70) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01)
Recommendations
Cited in
(83)- At the limits of thought
- scientific article; zbMATH DE number 7552285 (Why is no real title available?)
- The logic of Pit
- Relatives of the Russell Paradox
- Distributive laws for the coinductive solution of recursive equations
- CHARACTERIZING EXISTENCE OF A MEASURABLE CARDINAL VIA MODAL LOGIC
- New architectures for constructed complex systems
- Virtual worlds as meeting places for formal systems
- Knowledge representation, the world wide web, and the evolution of logic
- The essence of constraint propagation
- Foundations of applied mathematics. I
- The future of mathematics in economics: a philosophically grounded proposal
- On non-wellfounded sets as fixed points of substitutions
- Probability updating using second order probabilities and conditional event algebra
- On the computational complexity of bisimulation, redux
- The category-theoretic solution of recursive program schemes
- Completeness for flat modal fixpoint logics
- Models for a paraconsistent set theory
- Distributivity of categories of coalgebras
- Three-variable statements of set-pairing
- Paradox, ZF, and the axiom of foundation
- scientific article; zbMATH DE number 1472099 (Why is no real title available?)
- Modal languages and bounded fragments of predicate logic
- Non-well-founded extensions of V
- scientific article; zbMATH DE number 2152234 (Why is no real title available?)
- Infinite trees and completely iterative theories: A coalgebraic view
- Universal coalgebra: A theory of systems
- From modal logic to terminal coalgebras
- p-adic physics, non-well-founded reality and unconventional computing
- Parametric corecursion
- A co-inductive language and truth degrees
- Completely iterative algebras and completely iterative monads
- ON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATION
- Ordinal analysis by transformations
- First-order classical modal logic
- Semantics for finite delay
- A report on a game on the universe of sets
- The inclosure scheme and the solution to the paradoxes of self-reference
- Set graphs. II. Complexity of set graph recognition and similar problems
- \(FO(FD)\): extending classical logic with rule-based fixpoint definitions
- Non‐circular, non‐well‐founded set universes
- Coalgebraic logic
- On modal -calculus and non-well-founded set theory
- A Cook's tour of the finitary non-well-founded sets
- Fixed points and unfounded chains
- A neglected resolution of Russell's paradox of propositions
- scientific article; zbMATH DE number 719912 (Why is no real title available?)
- Multigames and strategies, coalgebraically
- The graph conception of set
- Forcing and antifoundation
- Existence and definability of states of the world
- Non-well-founded trees in categories
- An efficient algorithm for computing bisimulation equivalence
- Undirecting membership in models of anti-foundation
- On coalgebra based on classes
- The Ackermann encoding and its siblings
- Automata and fixed point logic: a coalgebraic perspective
- Modality, bisimulation and interpolation in infinitary logic
- Swinging types=functions+relations+transition systems
- Is weak supplementation analytic?
- On rational monads and free iterative theories
- Propositional discourse logic
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations
- Coalgebras in functional programming and type theory
- Beppo Levi's analysis of the paradoxes
- Conway games, coalgebraically
- Of sheep and wolves: equivalence and disagreement in set theory
- Finite models constructed from canonical formulas
- Modal correspondence for models
- What is the coalgebraic analogue of Birkhoff's variety theorem?
- Logic of paradoxes in classical set theories
- Interpolation and preservation in \({\mathcal{ML}}_{\omega_1}\)
- The never-ending recursion
- THE ITERATIVE CONCEPTION OF SET
- From chaotic iteration to constraint propagation
- A coalgebraic view of infinite trees and iteration
- Linear ordering on graphs, anti-founded sets and polynomial time computability
- Why Sets?
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus
- Equivalences and congruences on infinite Conway games
- Conditional epistemic planning
- Towards an integration science. The influence of Richard Bellman on our research.
- Non-adjunctive inference and classical modalities
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4717366)
