scientific article; zbMATH DE number 952378

Publication date: 1 December 1996

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

graphs semantic paradoxes self-reference nonstandard set theory games corecursion circularity streams hypersets non-wellfounded sets antifoundation axiom greatest fixed points uniform operators

Mathematics Subject Classification ID

Philosophy of mathematics (00A30) Philosophical and critical aspects of logic and foundations (03A05) 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) Nonclassical and second-order set theories (03E70) Discrete mathematics in relation to computer science (68R99)

Related Items (76)

The future of mathematics in economics: a philosophically grounded proposal ⋮ ON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATION ⋮ Conway Games, Coalgebraically ⋮ Equivalences and Congruences on Infinite Conway Games ⋮ Distributivity of categories of coalgebras ⋮ An efficient algorithm for computing bisimulation equivalence ⋮ Three-variable statements of set-pairing ⋮ A Co-inductive Language and Truth Degrees ⋮ Paradox, ZF, and the Axiom of Foundation ⋮ Conditional Epistemic Planning ⋮ Beppo Levi's analysis of the paradoxes ⋮ The category-theoretic solution of recursive program schemes ⋮ First-order classical modal logic ⋮ From chaotic iteration to constraint propagation ⋮ Non-well-founded trees in categories ⋮ Undirecting membership in models of anti-foundation ⋮ Semantics for finite delay ⋮ Multigames and strategies, coalgebraically ⋮ The never-ending recursion ⋮ Is weak supplementation analytic? ⋮ Knowledge representation, the world wide web, and the evolution of logic ⋮ Infinite trees and completely iterative theories: A coalgebraic view ⋮ New architectures for constructed complex systems ⋮ Virtual worlds as meeting places for formal systems ⋮ Foundations of applied mathematics. I ⋮ On non-wellfounded sets as fixed points of substitutions ⋮ Completeness for flat modal fixpoint logics ⋮ Coalgebras in functional programming and type theory ⋮ Logic of paradoxes in classical set theories ⋮ Linear ordering on graphs, anti-founded sets and polynomial time computability ⋮ Bisimulation-invariant PTIME and higher-dimensional $\mu$-calculus ⋮ The essence of constraint propagation ⋮ On coalgebra based on classes ⋮ Probability updating using second order probabilities and conditional event algebra ⋮ Propositional discourse logic ⋮ Finite models constructed from canonical formulas ⋮ At the Limits of Thought ⋮ A report on a game on the universe of sets ⋮ The inclosure scheme and the solution to the paradoxes of self-reference ⋮ A Coalgebraic View of Infinite Trees and Iteration ⋮ Set graphs. II. Complexity of set graph recognition and similar problems ⋮ $p$-adic physics, non-well-founded reality and unconventional computing ⋮ THE ITERATIVE CONCEPTION OF SET ⋮ Forcing and antifoundation ⋮ FO(FD): Extending classical logic with rule-based fixpoint definitions ⋮ Interpolation and preservation in ${\mathcal{ML}}_{\omega_1}$ ⋮ Completely iterative algebras and completely iterative monads ⋮ On the computational complexity of bisimulation, redux ⋮ Non‐well‐founded extensions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbf {V}$\end{document} ⋮ Fixed points and unfounded chains ⋮ Parametric corecursion ⋮ From modal logic to terminal coalgebras ⋮ On modal $\mu$-calculus and non-well-founded set theory ⋮ Distributive laws for the coinductive solution of recursive equations ⋮ Automata and fixed point logic: a coalgebraic perspective ⋮ Models for a paraconsistent set theory ⋮ Unnamed Item ⋮ Existence and definability of states of the world ⋮ The logic of Pit ⋮ What is the coalgebraic analogue of Birkhoff's variety theorem? ⋮ Why Sets? ⋮ The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations ⋮ Ordinal analysis by transformations ⋮ The graph conception of set ⋮ Modal languages and bounded fragments of predicate logic ⋮ Modal correspondence for models ⋮ Swinging types=functions+relations+transition systems ⋮ On Rational Monads and Free Iterative Theories ⋮ Coalgebraic logic ⋮ Modality, bisimulation and interpolation in infinitary logic ⋮ CHARACTERIZING EXISTENCE OF A MEASURABLE CARDINAL VIA MODAL LOGIC ⋮ Universal coalgebra: A theory of systems ⋮ Towards an integration science. The influence of Richard Bellman on our research. ⋮ A NEGLECTED RESOLUTION OF RUSSELL’S PARADOX OF PROPOSITIONS ⋮ Relatives of the Russell Paradox ⋮ Non-adjunctive inference and classical modalities

This page was built for publication: