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