The following pages link to (Q4717366):
Displaying 50 items.
- Knowledge representation, the world wide web, and the evolution of logic (Q408317) (← links)
- Propositional discourse logic (Q484942) (← links)
- Completeness for flat modal fixpoint logics (Q638475) (← links)
- Coalgebras in functional programming and type theory (Q639643) (← links)
- On the computational complexity of bisimulation, redux (Q703845) (← links)
- The decision problem for a three-sorted fragment of set theory with restricted quantification and finite enumerations (Q737087) (← links)
- The graph conception of set (Q742483) (← links)
- Non-adjunctive inference and classical modalities (Q812093) (← links)
- The category-theoretic solution of recursive program schemes (Q860876) (← links)
- First-order classical modal logic (Q863182) (← links)
- Non-well-founded trees in categories (Q876383) (← links)
- Multigames and strategies, coalgebraically (Q890378) (← links)
- Ordinal analysis by transformations (Q1006618) (← links)
- Modal languages and bounded fragments of predicate logic (Q1267082) (← links)
- Modal correspondence for models (Q1267083) (← links)
- Coalgebraic logic (Q1295427) (← links)
- Modality, bisimulation and interpolation in infinitary logic (Q1295444) (← 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)
- On non-wellfounded sets as fixed points of substitutions (Q1409302) (← links)
- On coalgebra based on classes (Q1434346) (← links)
- Swinging types=functions+relations+transition systems (Q1575635) (← links)
- Universal coalgebra: A theory of systems (Q1583483) (← links)
- Towards an integration science. The influence of Richard Bellman on our research. (Q1584626) (← links)
- The future of mathematics in economics: a philosophically grounded proposal (Q1616105) (← links)
- The never-ending recursion (Q1688713) (← links)
- \(p\)-adic physics, non-well-founded reality and unconventional computing (Q1760203) (← links)
- Completely iterative algebras and completely iterative monads (Q1767976) (← 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)
- Distributivity of categories of coalgebras (Q1884878) (← links)
- An efficient algorithm for computing bisimulation equivalence (Q1884935) (← links)
- Three-variable statements of set-pairing (Q1885036) (← links)
- Linear ordering on graphs, anti-founded sets and polynomial time computability (Q1960423) (← links)
- Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus (Q1960425) (← links)
- The essence of constraint propagation (Q1960525) (← links)
- Probability updating using second order probabilities and conditional event algebra (Q1971771) (← links)
- Set graphs. II. Complexity of set graph recognition and similar problems (Q2253199) (← links)
- Beppo Levi's analysis of the paradoxes (Q2392013) (← links)
- Logic of paradoxes in classical set theories (Q2441742) (← links)
- Finite models constructed from canonical formulas (Q2462682) (← links)
- A report on a game on the universe of sets (Q2473763) (← links)
- The inclosure scheme and the solution to the paradoxes of self-reference (Q2475296) (← links)
- Forcing and antifoundation (Q2486987) (← links)
- Distributive laws for the coinductive solution of recursive equations (Q2495644) (← links)
- Automata and fixed point logic: a coalgebraic perspective (Q2495648) (← links)
- The logic of Pit (Q2500833) (← links)
