scientific article; zbMATH DE number 952378

zbMATH Open0865.03002MaRDI QIDQ4717366FDOQ4717366

Jon Barwise, Lawrence S. Moss

Publication date: 1 December 1996

Title of this publication is not available (Why is that?)

zbMATH Keywords

graphssemantic paradoxescorecursiongamescircularitystreamsself-referencehypersetsantifoundation axiomnon-wellfounded setsnonstandard set theorygreatest fixed pointsuniform operators

Mathematics Subject Classification ID

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)

Cited In (80)

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

   Recommendations

• Title not available (Why is that?) 👍 👎
• Anti-admissible sets 👍 👎
• The graph conception of set 👍 👎
• Title not available (Why is that?) 👍 👎

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)