Pages that link to "Item:Q3992552"

The following pages link to Non-well-founded sets. Foreword by Jon Barwise (Q3992552):

Displaying 50 items.

• Reconciling Austinian and Russellian accounts of the liar paradox (Q1337509) (← links)
• Issues in commonsense set theory (Q1346620) (← links)
• A general construction of hyperuniverses (Q1351794) (← links)
• HYPERSOLVER: A graphical tool for commonsense set theory (Q1357081) (← links)
• An algebraic theory of structured objects (Q1377554) (← links)
• Constructing process categories (Q1391863) (← links)
• \(\Delta\)-languages for sets and LOGSPACE computable graph transformers (Q1392148) (← links)
• Semantics for finite delay (Q1392281) (← links)
• Infinite trees and completely iterative theories: A coalgebraic view (Q1399957) (← links)
• New architectures for constructed complex systems (Q1402194) (← links)
• Virtual worlds as meeting places for formal systems (Q1402195) (← links)
• Computer proofs about finite and regular sets: The unifying concept of subvariance. (Q1404990) (← links)
• On non-wellfounded sets as fixed points of substitutions (Q1409302) (← links)
• The decidability of the \(\forall ^*\exists\) class and the axiom of foundation (Q1409304) (← links)
• Broadening the iterative conception of set (Q1422104) (← links)
• Mathematical modal logic: A view of its evolution (Q1422628) (← links)
• On coalgebra based on classes (Q1434346) (← links)
• Object-oriented hybrid systems of coalgebras plus monoid actions (Q1575271) (← links)
• A small final coalgebra theorem (Q1575951) (← links)
• Universal coalgebra: A theory of systems (Q1583483) (← links)
• Towards an integration science. The influence of Richard Bellman on our research. (Q1584626) (← links)
• Notions of symmetry in set theory with classes (Q1591208) (← links)
• The continuum as a final coalgebra (Q1603817) (← links)
• Operational and abstract semantics of the query language G-Log (Q1607222) (← links)
• A computable expression of closure to efficient causation (Q1617623) (← links)
• Self-referential propositions (Q1708964) (← links)
• Comparing material and structural set theories (Q1715477) (← links)
• Completeness for \(\mu\)-calculi: a coalgebraic approach (Q1731842) (← links)
• Applying model-checking to solve queries on semistructured data (Q1749228) (← links)
• \(p\)-adic physics, non-well-founded reality and unconventional computing (Q1760203) (← links)
• On modal \(\mu\)-calculus and non-well-founded set theory (Q1771199) (← links)
• Models for a paraconsistent set theory (Q1775861) (← links)
• Existence and definability of states of the world (Q1779722) (← links)
• Slime mould games based on rough set theory (Q1797883) (← links)
• Towards a computation system based on set theory (Q1825191) (← links)
• Bernays-Gödel type theory (Q1861492) (← links)
• What is so special with the powerset operation? (Q1882625) (← links)
• An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
• Three-variable statements of set-pairing (Q1885036) (← links)
• Verifying persistent security properties (Q1886452) (← links)
• Common knowledge: Relating anti-founded situation semantics to modal logic neighbourhood semantics (Q1895975) (← links)
• Decidability and completeness for open formulas of membership theories (Q1903592) (← links)
• A set-theoretic translation method for polymodal logics (Q1904398) (← links)
• Set theory for verification. II: Induction and recursion (Q1904402) (← links)
• Choice principles in hyperuniverses (Q1919525) (← links)
• Non-deterministic inductive definitions (Q1935375) (← links)
• Counting extensional acyclic digraphs (Q1944136) (← links)
• Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
• Bisimulation for probabilistic transition systems: A coalgebraic approach (Q1960528) (← links)
• A relation algebraic approach to interaction categories (Q1961872) (← links)