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