The following pages link to Yuri Gurevich (Q293302):
Displayed 50 items.
- (Q204639) (redirect page) (← links)
- A variation on the zero-one law (Q293304) (← links)
- Abstract Hilbertian deductive systems, infon logic, and Datalog (Q393078) (← links)
- Impugning randomness, convincingly (Q454396) (← links)
- Partial updates (Q555785) (← links)
- Can abstract state machines be useful in language theory? (Q880169) (← links)
- Content-dependent chunking for differential compression, the local maximum approach (Q972380) (← links)
- The decision problem for linear temporal logic (Q1062669) (← links)
- The monadic theory and the ''next world'' (Q1063588) (← links)
- Henkin quantifiers and complete problems (Q1088983) (← links)
- Fixed-point extensions of first-order logic (Q1090327) (← links)
- Choiceless polynomial time (Q1125059) (← links)
- Monadic theory of order and topology. II (Q1137035) (← links)
- Average case completeness (Q1176231) (← links)
- A resolving procedure for the extended theory of ordered abelian groups (Q1211064) (← links)
- Monadic theory of order and topology, I (Q1238809) (← links)
- Intuitionistic logic with strong negation (Q1241438) (← links)
- On matijasevitch's nontraditional approach to search problems (Q1262126) (← links)
- Datalog vs first-order logic (Q1342861) (← links)
- Metafinite model theory (Q1383163) (← links)
- Equivalence is in the eye of the beholder (Q1391750) (← links)
- Logic with equality: Partisan corroboration and shifted pairing (Q1854299) (← links)
- Abstract state machines and computationally complete query languages (Q1854519) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- Monadic simultaneous rigid \(E\)-unification (Q1960540) (← links)
- Quantum circuits with classical channels and the principle of deferred measurements (Q2139049) (← links)
- Database query processing using finite cursor machines (Q2272221) (← links)
- Braided distributivity (Q2286738) (← links)
- The decision problem for the logic of predicates and of operations (Q2545171) (← links)
- A decision problem for decision problems (Q2550382) (← links)
- Remarks on Berger's paper on the domino problem (Q2556400) (← links)
- Semantic essence of AsmL (Q2571205) (← links)
- (Q2729229) (← links)
- (Q2753663) (← links)
- (Q2753664) (← links)
- (Q2753700) (← links)
- (Q2753706) (← links)
- (Q2753707) (← links)
- (Q2753719) (← links)
- (Q2767174) (← links)
- Basic primal infon logic (Q2804323) (← links)
- Past Present (Q2814832) (← links)
- What Is an Algorithm? (Q2891359) (← links)
- From Primal Infon Logic with Individual Variables to Datalog (Q2900510) (← links)
- Foundational Analyses of Computation (Q2904416) (← links)
- Logic of infons (Q2946626) (← links)
- Persistent queries in the behavioral theory of algorithms (Q2946634) (← links)
- Time polynomial in input or output (Q3033752) (← links)
- The Word Problem for Lattice-Order Groups (Q3043204) (← links)
- (Q3043795) (← links)