Search the dblp DataBase
Andreas Blass :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Andreas Blass , Yuri Gurevich , Dexter Kozen A Zero-One Law for Logic with a Fixed-Point Operator [Citation Graph (3, 0)][DBLP ] Information and Control, 1985, v:67, n:1-3, pp:70-90 [Journal ] Andreas Blass , Yuri Gurevich On the Unique Satisfiability Problem [Citation Graph (1, 0)][DBLP ] Information and Control, 1982, v:55, n:1-3, pp:80-88 [Journal ] Andreas Blass Abstract State Machines and Pure Mathematics. [Citation Graph (0, 0)][DBLP ] Abstract State Machines, 2000, pp:9-21 [Conf ] Andreas Blass , Yuri Gurevich , Jan Van den Bussche Abstract State Machines and Computationally Complete Query Languages. [Citation Graph (0, 0)][DBLP ] Abstract State Machines, 2000, pp:22-33 [Conf ] Andreas Blass , Yuri Gurevich Existential Fixed-Point Logic. [Citation Graph (0, 0)][DBLP ] Computation Theory and Logic, 1987, pp:20-36 [Conf ] Andreas Blass Is Game Semantics Necessary? [Citation Graph (0, 0)][DBLP ] CSL, 1993, pp:66-77 [Conf ] Andreas Blass , Yuri Gurevich Background, Reserve, and Gandy Machines. [Citation Graph (0, 0)][DBLP ] CSL, 2000, pp:1-17 [Conf ] Andreas Blass , Yuri Gurevich Choiceless Polynominal Time Computation and the Zero-One Law. [Citation Graph (0, 0)][DBLP ] CSL, 2000, pp:18-40 [Conf ] Andreas Blass , Yuri Gurevich On the Reduction Theory for Average Case Complexity. [Citation Graph (0, 0)][DBLP ] CSL, 1990, pp:17-30 [Conf ] Andreas Blass , Yuri Gurevich , Lev Nachmanson , Margus Veanes Play to Test. [Citation Graph (0, 0)][DBLP ] FATES, 2005, pp:32-46 [Conf ] Andreas Blass , Boris Mitavskiy NP-Completeness of Deciding Binary Genetic Encodability. [Citation Graph (0, 0)][DBLP ] FOGA, 2005, pp:58-74 [Conf ] Andreas Blass , Yuri Gurevich Randomizing Reductions of Search Problems. [Citation Graph (0, 0)][DBLP ] FSTTCS, 1991, pp:10-24 [Conf ] Andreas Blass , Yuri Gurevich Evolving Algebras and Linear Time Hierarchy. [Citation Graph (0, 0)][DBLP ] IFIP Congress (1), 1994, pp:383-390 [Conf ] Andreas Blass , Yuri Gurevich Equivalence relations, invariants, and normal forms. [Citation Graph (0, 0)][DBLP ] Logic and Machines, 1983, pp:24-42 [Conf ] Andreas Blass Adapting Logics. [Citation Graph (0, 0)][DBLP ] LICS, 2006, pp:123- [Conf ] Andreas Blass Needed reals and recursion in generic reals. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 2001, v:109, n:1-2, pp:77-88 [Journal ] Andreas Blass A Game Semantics for Linear Logic. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1992, v:56, n:1-3, pp:183-220 [Journal ] Andreas Blass , Yuri Gurevich , Saharon Shelah Choiceless Polynomial Time. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1999, v:100, n:1-3, pp:141-187 [Journal ] Andreas Blass , Andre Scedrov Complete Topoi Representing Models of Set Theory. [Citation Graph (0, 0)][DBLP ] Ann. Pure Appl. Logic, 1992, v:57, n:1, pp:1-26 [Journal ] Andreas Blass Homotopy and Homology of Finite Lattices. [Citation Graph (0, 0)][DBLP ] Electr. J. Comb., 2003, v:10, n:, pp:- [Journal ] Andreas Blass , Yuri Gurevich Algorithms: A Quest for Absolute Definitions. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2003, v:81, n:, pp:195-225 [Journal ] Andreas Blass , Yuri Gurevich Why Sets? (Column: Logic in Computer Science). [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2004, v:84, n:, pp:139-156 [Journal ] Andreas Blass , Benjamin Rossman Explicit Graphs with Extension Properties. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2005, v:86, n:, pp:166-175 [Journal ] Andreas Blass Logic in Computer Ccience Column, guest authors. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 1988, v:36, n:, pp:57-65 [Journal ] Andreas Blass , Yuri Gurevich A New Zero-One Law and Strong Extension Axioms. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2000, v:72, n:, pp:103-122 [Journal ] Andreas Blass , Yuri Gurevich The Underlying Logic of Hoare Logic. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2000, v:70, n:, pp:82-111 [Journal ] Andreas Blass , Yuri Gurevich Pairwise Testing. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2002, v:78, n:, pp:100-132 [Journal ] Andreas Blass , Yuri Gurevich Algorithms vs. Machines. [Citation Graph (0, 0)][DBLP ] Bulletin of the EATCS, 2002, v:77, n:, pp:96-119 [Journal ] Andreas Blass , Yuri Gurevich , Jan Van den Bussche Abstract State Machines and Computationally Complete Query Languages. [Citation Graph (0, 0)][DBLP ] Inf. Comput., 2002, v:174, n:1, pp:20-36 [Journal ] Andreas Blass Some Semantical Aspects of Linear Logic. [Citation Graph (0, 0)][DBLP ] Logic Journal of the IGPL, 1997, v:5, n:4, pp:- [Journal ] Andreas Blass , Yuri Gurevich On Matijasevitch's Nontraditional Approach to Search Problems. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1989, v:32, n:1, pp:41-45 [Journal ] Andreas Blass , Yuri Gurevich , Vladik Kreinovich , Luc Longpré A Variation on the Zero-One Law. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1998, v:67, n:1, pp:29-30 [Journal ] Andreas Blass , Paul Erdös , Alan D. Taylor Diverse Homogeneous Sets. [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. A, 1992, v:59, n:2, pp:312-317 [Journal ] Andreas Blass , Frank Harary , Zevi Miller Which trees are link graphs? [Citation Graph (0, 0)][DBLP ] J. Comb. Theory, Ser. B, 1980, v:29, n:3, pp:277-292 [Journal ] Andreas Blass The Intersection of Nonstandard Models of Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1972, v:37, n:1, pp:103-106 [Journal ] Andreas Blass Theories without Countable Models. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1972, v:37, n:3, pp:562-568 [Journal ] Andreas Blass On the Inadequacy of Inner Models. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1972, v:37, n:3, pp:569-571 [Journal ] Andreas Blass On Certain Types and Models for Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1974, v:39, n:1, pp:151-162 [Journal ] Andreas Blass Amalgamation of Nonstandard Models of Arithmetic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1977, v:42, n:3, pp:372-386 [Journal ] Andreas Blass Ramsey's Theorem in the Hierarchy of Choice Principles. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1977, v:42, n:3, pp:387-390 [Journal ] Andreas Blass Some Initial Segments of the Rudin-Keisler Ordering. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1981, v:46, n:1, pp:147-157 [Journal ] Andreas Blass The Model of Set Theory Generated by Countably Many Generic Reals. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1981, v:46, n:4, pp:732-752 [Journal ] Andreas Blass There are not Exactly Five Objects. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1984, v:49, n:2, pp:467-469 [Journal ] Andreas Blass Acknowledgement of Priority. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1985, v:50, n:3, pp:781- [Journal ] Andreas Blass Infinitary Combinatorics and Modal Logic. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1990, v:55, n:2, pp:761-778 [Journal ] Andreas Blass An Induction Principle and Pigeonhole Principles for K-Finite Sets. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1995, v:60, n:4, pp:1186-1193 [Journal ] Andreas Blass , Douglas A. Cenzer Cores of pi1 1 Sets of Reals. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1974, v:39, n:4, pp:649-654 [Journal ] Andreas Blass , Yuri Gurevich The Logic of Choice. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2000, v:65, n:3, pp:1264-1310 [Journal ] Andreas Blass , Yuri Gurevich Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2003, v:68, n:1, pp:65-131 [Journal ] Andreas Blass , Yuri Gurevich , Saharon Shelah On Polynomial Time Computation over Unordered Structures. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 2002, v:67, n:3, pp:1093-1125 [Journal ] Andreas Blass , Louise Hay , Peter G. Hinman Meeting of the Association for Symbolic Logic: Chicago, 1985. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1986, v:51, n:2, pp:507-510 [Journal ] Andreas Blass , Claude Laflamme Consistency Results About Filters and the Number of Inequivalent Growth Types. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1989, v:54, n:1, pp:50-56 [Journal ] Andreas Blass , Heike Mildenberger On The Confinality of Ultrapowers. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1999, v:64, n:2, pp:727-736 [Journal ] Andreas Blass , Andre Scedrov Small Decidable Sheaves. [Citation Graph (0, 0)][DBLP ] J. Symb. Log., 1986, v:51, n:3, pp:726-731 [Journal ] Andreas Blass , Yuri Gurevich The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. [Citation Graph (0, 0)][DBLP ] J. UCS, 1997, v:3, n:4, pp:247-278 [Journal ] Andreas Blass , Victor Pambuccian Sperner spaces and first-order logic. [Citation Graph (0, 0)][DBLP ] Math. Log. Q., 2003, v:49, n:2, pp:111-114 [Journal ] Andreas Blass , Saharon Shelah Near Coherence of Filters III: A Simplified Consistency Proof. [Citation Graph (0, 0)][DBLP ] Notre Dame Journal of Formal Logic, 1989, v:30, n:4, pp:530-538 [Journal ] Andreas Blass , Yuri Gurevich Equivalence Relations, Invariants, and Normal Forms. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1984, v:13, n:4, pp:682-689 [Journal ] Andreas Blass , Yuri Gurevich Randomizing Reductions of Search Problems. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1993, v:22, n:5, pp:949-975 [Journal ] Andreas Blass , Yuri Gurevich Matrix Transformation Is Complete for the Average Case. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1995, v:24, n:1, pp:3-29 [Journal ] Andreas Blass , Yuri Gurevich Inadequacy of computable loop invariants. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2001, v:2, n:1, pp:1-11 [Journal ] Andreas Blass , Yuri Gurevich Abstract state machines capture parallel algorithms. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2003, v:4, n:4, pp:578-651 [Journal ] Andreas Blass , Yuri Gurevich Ordinary interactive small-step algorithms, I. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2006, v:7, n:2, pp:363-419 [Journal ] Andreas Blass , Yuri Gurevich , Dean Rosenzweig , Benjamin Rossman Interactive Small-Step Algorithms I: Axiomatization [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Andreas Blass , Yuri Gurevich , Dean Rosenzweig , Benjamin Rossman Interactive Small-Step Algorithms II: Abstract State Machines and the<br> Characterization Theorem [Citation Graph (0, 0)][DBLP ] CoRR, 2007, v:0, n:, pp:- [Journal ] Andreas Blass On exponentiation of G-sets. [Citation Graph (0, 0)][DBLP ] Discrete Mathematics, 1994, v:135, n:1-3, pp:69-79 [Journal ] Andreas Blass , Yuri Gurevich Ordinary interactive small-step algorithms, III. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2007, v:8, n:3, pp:- [Journal ] Andreas Blass , Yuri Gurevich Ordinary interactive small-step algorithms, II. [Citation Graph (0, 0)][DBLP ] ACM Trans. Comput. Log., 2007, v:8, n:3, pp:- [Journal ] Why Sets? [Citation Graph (, )][DBLP ] Existential Fixed-Point Logic, Universal Quantifiers, and Topoi. [Citation Graph (, )][DBLP ] Yuri, Logic, and Computer Science. [Citation Graph (, )][DBLP ] Exact Exploration and Hanging Algorithms. [Citation Graph (, )][DBLP ] One Useful Logic That Defines Its Own Truth. [Citation Graph (, )][DBLP ] Preface. [Citation Graph (, )][DBLP ] Random Orders and Gambler's Ruin. [Citation Graph (, )][DBLP ] When are two algorithms the same? [Citation Graph (, )][DBLP ] Persistent Queries [Citation Graph (, )][DBLP ] One useful logic that defines its own truth [Citation Graph (, )][DBLP ] Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog [Citation Graph (, )][DBLP ] Modular difference logic is hard [Citation Graph (, )][DBLP ] Search in 0.006secs, Finished in 0.010secs