scientific article
From MaRDI portal
Publication:3992552
zbMath0668.04001MaRDI QIDQ3992552
Publication date: 17 September 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
History of mathematics in the 20th century (01A60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Set theory (03E99)
Related Items
Dynamic semantics and circular propositions, A computable expression of closure to efficient causation, The coinductive resumption monad, What is so special with the powerset operation?, Non-well-founded sets via revision rules, Reconciling Austinian and Russellian accounts of the liar paradox, An efficient algorithm for computing bisimulation equivalence, Three-variable statements of set-pairing, Verifying persistent security properties, Relation lifting, a survey, Issues in commonsense set theory, Mathematical foundations of consciousness, Common knowledge: Relating anti-founded situation semantics to modal logic neighbourhood semantics, A general construction of hyperuniverses, HYPERSOLVER: A graphical tool for commonsense set theory, Decidability and completeness for open formulas of membership theories, A set-theoretic translation method for polymodal logics, Set theory for verification. II: Induction and recursion, The category-theoretic solution of recursive program schemes, An algebraic theory of structured objects, Choice principles in hyperuniverses, Non-well-founded trees in categories, Combination of constraint solvers for free and quasi-free structures, Terminal metric spaces of finitely branching and image finite linear processes, A fixpoint approach to finite delay and fairness, Relating first-order set theories, toposes and categories of classes, Constructing process categories, \(\Delta\)-languages for sets and LOGSPACE computable graph transformers, Semantics for finite delay, Multigames and strategies, coalgebraically, Proof systems for Moss' coalgebraic logic, Non-deterministic inductive definitions, 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, Modalities in the Stone age: a comparison of coalgebraic logics, Computer proofs about finite and regular sets: The unifying concept of subvariance., Counting extensional acyclic digraphs, On non-wellfounded sets as fixed points of substitutions, The decidability of the \(\forall ^*\exists\) class and the axiom of foundation, A synthetic axiomatization of map theory, The strength of extensionality. II: Weak weak set theories without infinity, Self-referential propositions, A Tractarian universe, Type inference for polymorphic references, Broadening the iterative conception of set, Comparing material and structural set theories, Mathematical modal logic: A view of its evolution, Linear ordering on graphs, anti-founded sets and polynomial time computability, Bisimulation for probabilistic transition systems: A coalgebraic approach, Relatively terminal coalgebras, A relation algebraic approach to interaction categories, Refinement modal logic, On coalgebra based on classes, Co-induction in relational semantics, Completeness for \(\mu\)-calculi: a coalgebraic approach, Logical feedback, Hypersets, Map theory, Applying model-checking to solve queries on semistructured data, Starting from the scenario Euclid-Bolyai-Einstein, Formal semantics for mutual belief, Declarative operations on nets, \(p\)-adic physics, non-well-founded reality and unconventional computing, Well- and non-well-founded Fregean extensions, Dynamics of mental activity, On modal \(\mu\)-calculus and non-well-founded set theory, On the final sequence of a finitary set functor, Iteration one more time, Models for a paraconsistent set theory, Existence and definability of states of the world, Slime mould games based on rough set theory, The strength of extensionality. I: Weak weak set theories with infinity, Ordinal analysis by transformations, A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets, A single-sorted theory of multisets, The graph conception of set, Non-well-founded sets modeled as ideal fixed points, Towards a computation system based on set theory, Object-oriented hybrid systems of coalgebras plus monoid actions, A small final coalgebra theorem, Topology, domain theory and theoretical computer science, Coalgebraic logic, Universal coalgebra: A theory of systems, Towards an integration science. The influence of Richard Bellman on our research., Notions of symmetry in set theory with classes, Hereditarily-finite sets, data bases and polynomial-time computability, Experimenting with Isabelle in ZF set theory, On plural reference and elementary set theory, Set-theoretical and other elementary models of the \(\lambda\)-calculus, Defining concurrent processes constructively, Bernays-Gödel type theory, The continuum as a final coalgebra, The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\), Set theory for verification. I: From foundations to functions, Operational and abstract semantics of the query language G-Log, A tableau-based decision procedure for a fragment of set theory with iterated membership, A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets, Control of discrete-event systems with partial observations using coalgebra and coinduction, ON DOUBLE-MEMBERSHIP GRAPHS OF MODELS OF ANTI-FOUNDATION, On coalgebra of real numbers, μ-Bicomplete Categories and Parity Games, Equivalences and Congruences on Infinite Conway Games, Final universes of processes, Three metric domains of processes for bisimulation, Applications of type theory, Bisimulations Generated from Corecursive Equations, Convenient category of processes and simulations I: Modulo strong bisimilarity, Relational set theory, Hennessy-Milner and van Benthem for instantial neighbourhood logic, Bisimulation as a logical relation, Inductive and Coinductive Topological Generation with Church's thesis and the Axiom of Choice, Paradox, ZF, and the Axiom of Foundation, Processes as terms: non-well-founded models for bisimulation, Rough and Near: Modal History of Two Theories, Algebras of UTxO blockchains, Undirecting membership in models of anti-foundation, A remark on probabilistic measures of coherence, A final coalgebra theorem, Mongruences and cofree coalgebras, Hennessy-Milner properties via topological compactness, Processes and hyperuniverses, An Ordered Category of Processes, Bisimulation and propositional intuitionistic logic, Denotational semantics as a foundation for cost recurrence extraction for functional languages, A concrete final coalgebra theorem for ZF set theory, Infinite objects in type theory, Codifying guarded definitions with recursive schemes, Is weak supplementation analytic?, Retracing some paths in process algebra, Nonwellfounded sets and programming language semantics, WHAT IS A RESTRICTIVE THEORY?, Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version, Unnamed Item, Proof-theoretic foundations of normal logic programs, Smooth coalgebra: testing vector analysis, Practical coinduction, Logic, spatial algorithms and visual reasoning, Vier Philosophen über semantische Paradoxien, Graham Priest's Mathematical Analysis of the Concept of Emptiness, Game characterizations and lower cones in the Weihrauch degrees, Modelling Multi-Agent Epistemic Planning in ASP, How to Reason Coinductively Informally, Coalgebra and abstraction, EVERY COUNTABLE MODEL OF SET THEORY EMBEDS INTO ITS OWN CONSTRUCTIBLE UNIVERSE, Computing the Maximum Bisimulation with Spiking Neural P Systems, Adding the power-set to description logics, An application of co-inductive types in Coq: Verification of the alternating bit protocol, Qal wa- omer and Theory of Massive-Parallel Proofs, The inclosure scheme and the solution to the paradoxes of self-reference, Ordinal operations on graph representations of sets, Unnamed Item, Rank-Based Symbolic Bisimulation, A Coalgebraic View of Infinite Trees and Iteration, Modal Rules are Co-Implications, Elements of Stream Calculus, Set graphs. II. Complexity of set graph recognition and similar problems, Goals and benchmarks for automated map reasoning, Sets and classes as many, ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’, Forcing and antifoundation, Antifoundation and transitive closure in the system of Zermelo, On Bourbaki's axiomatic system for set theory, Non‐well‐founded extensions of \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbf {V}$\end{document}, A coalgebraic presentation of structured transition systems, On the structure of categories of coalgebras, Parametric corecursion, Distributive laws for the coinductive solution of recursive equations, Final coalgebras for functors on measurable spaces, The strength of Mac Lane set theory, Unnamed Item, Terminal coalgebras and free iterative theories, Processes as formal power series: a coinductive approach to denotational semantics, Combination of constraint systems II: Rational amalgamation, TRUTHS, INDUCTIVE DEFINITIONS, AND KRIPKE-PLATEK SYSTEMS OVER SET THEORY, Why Sets?, On final coalgebras of power-set functors and saturated trees, A fixedpoint approach to implementing (Co)inductive definitions, On the Definability of Simulability and Bisimilarity by Finite Epistemic Models, Extending set functors to generalised metric spaces, On a graph connecting hyperbinary expansions, On Rational Monads and Free Iterative Theories, Structural relativity and informal rigour, Forcing with the Anti-Foundation axiom, CHARACTERIZING EXISTENCE OF A MEASURABLE CARDINAL VIA MODAL LOGIC, Situation Theory Reconsidered, Well-quasi-ordering hereditarily finite sets, Coalgebras as Types Determined by Their Elimination Rules, Final coalgebras and the Hennessy-Milner property, Simplified Coalgebraic Trace Equivalence, Nonsets, A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\), Final semantics for a higher order concurrent language
