The following pages link to Dexter Kozen (Q283763):
Displaying 49 items.
- A metrized duality theorem for Markov processes (Q283765) (← links)
- Computational inductive definability (Q598276) (← links)
- Rational spaces and set constraints (Q671675) (← links)
- Decomposition of algebraic functions (Q674743) (← links)
- Results on the propositional \(\mu\)-calculus (Q801893) (← links)
- Definability with bounded number of bound variables (Q922523) (← links)
- Local variable scoping and Kleene algebra with tests (Q929964) (← links)
- A probabilistic PDL (Q1063584) (← links)
- The complexity of elementary algebra and geometry (Q1096620) (← links)
- A finite model theorem for the propositional \(\mu\)-calculus (Q1117213) (← links)
- Complexity of Boolean algebras (Q1137036) (← links)
- Indexings of subrecursive classes (Q1140080) (← links)
- An elementary proof of the completeness of PDL (Q1147690) (← links)
- Semantics of probabilistic programs (Q1159979) (← links)
- Process logic: Expressiveness, decidability, completeness (Q1168965) (← links)
- Set constraints and logic programming (Q1271565) (← links)
- Optimal bounds for the change-making problem (Q1314390) (← links)
- A completeness theorem for Kleene algebras and the algebra of regular events (Q1327385) (← links)
- Efficient inference of partial types (Q1337466) (← links)
- Computing the Newtonian graph (Q1368688) (← links)
- On the completeness of propositional Hoare logic (Q1602554) (← links)
- Tarskian set constraints (Q1854523) (← links)
- Some results in dynamic model theory (Q1881264) (← links)
- Decidability of systems of set constraints with negative constraints (Q1900313) (← links)
- Left-handed completeness (Q2286746) (← links)
- Completeness and incompleteness in nominal Kleene algebra (Q2401017) (← links)
- Theory of computation. (Q2492014) (← links)
- On the complexity of reasoning in Kleene algebra (Q2506487) (← links)
- Formalizing Moessner's theorem and generalizations in \textsc{Nuprl} (Q2667184) (← links)
- (Q2762494) (← links)
- (Q2767087) (← links)
- NetKAT — A Formal System for the Verification of Networks (Q2789031) (← links)
- Probabilistic NetKAT (Q2802486) (← links)
- A Coalgebraic Decision Procedure for NetKAT (Q2819821) (← links)
- Strong Completeness for Markovian Logics (Q2849951) (← links)
- Left-Handed Completeness (Q2915142) (← links)
- Kleene Algebra with Products and Iteration Theories (Q2958536) (← links)
- Capsules and Separation (Q2986818) (← links)
- Nominal Automata with Name Binding (Q2988364) (← links)
- Church–Rosser Made Easy (Q3000279) (← links)
- Computing with Capsules (Q3167568) (← links)
- New (Q3178271) (← links)
- On the Coalgebraic Theory of Kleene Algebra with Tests (Q3299849) (← links)
- (Q3358736) (← links)
- On Moessner’s Theorem (Q4921852) (← links)
- The Ackermann Award 2018 (Q5079720) (← links)
- (Q5178454) (← links)
- (Q5507097) (← links)
- Realization of Coinductive Types (Q5739360) (← links)
