The following pages link to (Q4023900):
Displaying 50 items.
- A scalable module system (Q391632) (← links)
- Algebraic models of deviant modal operators based on De Morgan and Kleene lattices (Q433065) (← links)
- Exploring conditional rewriting logic computations (Q485831) (← links)
- A Henneberg-based algorithm for generating tree-decomposable minimally rigid graphs (Q507133) (← links)
- On the completeness and decidability of duration calculus with iteration (Q557828) (← links)
- Towards the hierarchical verification of reactive systems (Q596025) (← links)
- The decidability of a fragment of \(\text{BB}'\text{IW}\)-logic (Q596035) (← links)
- Strong normalisation in the \(\pi\)-calculus (Q598201) (← links)
- Independent subbases and non-redundant codings of separable metrizable spaces (Q616937) (← links)
- On intuitionistic modal and tense logics and their classical companion logics: topological semantics and bisimulations (Q636275) (← links)
- Coalgebras in functional programming and type theory (Q639643) (← links)
- A compositional semantic basis for the analysis of equational Horn programs (Q671509) (← links)
- Elements of generalized ultrametric domain theory (Q672055) (← links)
- A hierarchy of temporal logics with past (Q672329) (← links)
- Natural termination (Q673622) (← links)
- Translations between modal logics of reactive systems (Q674003) (← links)
- Termination is not modular for confluent variable-preserving term rewriting systems (Q674186) (← links)
- The probabilistic powerdomain for stably compact spaces (Q703479) (← links)
- Debugging Maude programs via runtime assertion checking and trace slicing (Q739630) (← links)
- Obituary: Nicolaas Govert de Bruijn (1918--2012). Mathematician, computer scientist, logician (Q740456) (← links)
- N. G. de Bruijn's contribution to the formalization of mathematics (Q740481) (← links)
- Syntactic control of concurrency (Q817845) (← links)
- A logical approach to stable domains (Q859843) (← links)
- A formal fuzzy reasoning system and reasoning mechanism based on propositional modal logic (Q859844) (← links)
- Preferential choice and coordination conditions (Q864506) (← links)
- Innovations in computational type theory using Nuprl (Q865639) (← links)
- Partial Horn logic and Cartesian categories (Q866572) (← links)
- The two-way rewriting in action: removing the mystery of Euler-Glaisher's map (Q882113) (← links)
- Infinitary rewriting: meta-theory and convergence (Q884993) (← links)
- On \(\Lambda_{\alpha}\)-sets and the associated topology \(T^{\Lambda_\alpha}\) (Q895193) (← links)
- Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility (Q896904) (← links)
- Termination of just/fair computations in term rewriting (Q924727) (← links)
- Primitive recursive selection functions for existential assertions over abstract algebras (Q941429) (← links)
- On \((LC, s)\)-continuous functions (Q953583) (← links)
- A compact fixpoint semantics for term rewriting systems (Q987981) (← links)
- Generating priority rewrite systems for OSOS process languages (Q1012121) (← links)
- Topology on words (Q1019711) (← links)
- Applications of infinitary lambda calculus (Q1021568) (← links)
- Higher-order rewrite systems and their confluence (Q1127334) (← links)
- How to win a game with features (Q1271569) (← links)
- Explicit substitution. On the edge of strong normalization (Q1274458) (← links)
- Induction and recursion on the partial real line with applications to Real PCF (Q1274810) (← links)
- Structural induction and coinduction in a fibrational setting (Q1275820) (← links)
- Order-sorted inductive types (Q1286367) (← links)
- Perpetual reductions in \(\lambda\)-calculus (Q1286373) (← links)
- Properly injective spaces and function spaces (Q1295213) (← links)
- A complete equational axiomatization for prefix iteration (Q1342264) (← links)
- On modal mu-calculus and Büchi tree automata (Q1349728) (← links)
- PCF extended with real numbers (Q1349926) (← links)
- Fast and simple nested fixpoints (Q1350911) (← links)
