DBLP: Andreas Blass

	2011
j67		Andreas Blass, Yuri Gurevich: Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. 12(2): 16 (2011)
p2		Andreas Blass, Yuri Gurevich: Zero-One Laws: Thesauri and Parametric Conditions. Proof, Computation and Agency 2011: 99-114
	2010
j66		Andreas Blass, Yuri Gurevich, Efim Hudis: The Tower-of-Babel Problem, and Security Assesment Sharing. Bulletin of the EATCS 101: 161-182 (2010)
j65		Andreas Blass, Yuri Gurevich: Hilbertian Deductive Systems, Infon Logic, and Datalog. Bulletin of the EATCS 102: 122-150 (2010)
j64		Nikolaj Bjørner, Andreas Blass, Yuri Gurevich: Content-dependent chunking for differential compression, the local maximum approach. J. Comput. Syst. Sci. 76(3-4): 154-203 (2010)
c19		Andreas Blass, Nachum Dershowitz, Wolfgang Reisig: Yuri, Logic, and Computer Science. Fields of Logic and Computation 2010: 1-48
c18		Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman: Evidential Authorization. The Future of Software Engineering 2010: 73-99
c17		Andreas Blass: Existential Fixed-Point Logic, Universal Quantifiers, and Topoi. Fields of Logic and Computation 2010: 108-134
c16		Andreas Blass, Nachum Dershowitz, Yuri Gurevich: Exact Exploration and Hanging Algorithms. CSL 2010: 140-154
e1		Andreas Blass, Nachum Dershowitz, Wolfgang Reisig (Eds.): Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday. Lecture Notes in Computer Science 6300, Springer 2010, isbn 978-3-642-15024-1
	2009
j63		Andreas Blass, Su Gao, Yi Zhang: Preface. Ann. Pure Appl. Logic 158(3): 155 (2009)
j62		Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? Bulletin of Symbolic Logic 15(2): 145-168 (2009)
	2008
j61		Andreas Blass, Yuri Gurevich: Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bulletin of the EATCS 95: 164-182 (2008)
j60		Andreas Blass, Yuri Gurevich: Program termination and well partial orderings. ACM Trans. Comput. Log. 9(3) (2008)
j59		Andreas Blass, Yuri Gurevich: Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. 9(3) (2008)
c15		Andreas Blass: Why Sets? Pillars of Computer Science 2008: 179-198
c14		Andreas Blass, Yuri Gurevich: One Useful Logic That Defines Its Own Truth. MFCS 2008: 1-15
i7		Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? CoRR abs/0811.0811 (2008)
i6		Andreas Blass, Yuri Gurevich: Persistent Queries. CoRR abs/0811.0819 (2008)
i5		Andreas Blass, Yuri Gurevich: One useful logic that defines its own truth. CoRR abs/0811.0964 (2008)
i4		Andreas Blass, Yuri Gurevich: Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. CoRR abs/0811.0977 (2008)
i3		Nikolaj Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi: Modular difference logic is hard. CoRR abs/0811.0987 (2008)
	2007
j58		Andreas Blass, Yuri Gurevich: Zero-One Laws: Thesauri and Parametric Conditions. Bulletin of the EATCS 91: 125-144 (2007)
j57		Andreas Blass, Yuri Gurevich: Background of Computation. Bulletin of the EATCS 92: 82-114 (2007)
j56		Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization. Logical Methods in Computer Science 3(4) (2007)
j55		Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Logical Methods in Computer Science 3(4) (2007)
j54		Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. 8(3) (2007)
j53		Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. 8(3) (2007)
i2		Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization. CoRR abs/0707.3782 (2007)
i1		Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. CoRR abs/0707.3789 (2007)
	2006
j52		Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, I. ACM Trans. Comput. Log. 7(2): 363-419 (2006)
c13		Andreas Blass: Adapting Logics. LICS 2006: 123
	2005
j51		Andreas Blass, Gábor Braun: Random Orders and Gambler's Ruin. Electr. J. Comb. 12 (2005)
j50		Andreas Blass, Benjamin Rossman: Explicit Graphs with Extension Properties. Bulletin of the EATCS 86: 166-175 (2005)
c12		Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes: Play to Test. FATES 2005: 32-46
c11		Andreas Blass, Boris Mitavskiy: NP-Completeness of Deciding Binary Genetic Encodability. FOGA 2005: 58-74
	2004
j49		Andreas Blass, Yuri Gurevich: Why Sets? (Column: Logic in Computer Science). Bulletin of the EATCS 84: 139-156 (2004)
	2003
j48		Andreas Blass: Homotopy and Homology of Finite Lattices. Electr. J. Comb. 10 (2003)
j47		Andreas Blass, Yuri Gurevich: Algorithms: A Quest for Absolute Definitions. Bulletin of the EATCS 81: 195-225 (2003)
j46		Andreas Blass, Yuri Gurevich: Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. J. Symb. Log. 68(1): 65-131 (2003)
j45		Andreas Blass, Victor Pambuccian: Sperner spaces and first-order logic. Math. Log. Q. 49(2): 111-114 (2003)
j44		Andreas Blass, Yuri Gurevich: Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4): 578-651 (2003)
	2002
j43		Andreas Blass, Yuri Gurevich: Algorithms vs. Machines. Bulletin of the EATCS 77: 96-119 (2002)
j42		Andreas Blass, Yuri Gurevich: Pairwise Testing. Bulletin of the EATCS 78: 100-132 (2002)
j41		Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174(1): 20-36 (2002)
j40		Andreas Blass, Yuri Gurevich, Saharon Shelah: On Polynomial Time Computation over Unordered Structures. J. Symb. Log. 67(3): 1093-1125 (2002)
	2001
j39		Andreas Blass: Needed reals and recursion in generic reals. Ann. Pure Appl. Logic 109(1-2): 77-88 (2001)
j38		Andreas Blass, Yuri Gurevich: Inadequacy of computable loop invariants. ACM Trans. Comput. Log. 2(1): 1-11 (2001)
p1		Andreas Blass, Yuri Gurevich: The Underlying Logic of Hoare Logic. Current Trends in Theoretical Computer Science 2001: 409-436
	2000
j37		Andreas Blass, Yuri Gurevich: The Underlying Logic of Hoare Logic. Bulletin of the EATCS 70: 82-111 (2000)
j36		Andreas Blass, Yuri Gurevich: A New Zero-One Law and Strong Extension Axioms. Bulletin of the EATCS 72: 103-122 (2000)
j35		Andreas Blass, Yuri Gurevich: The Logic of Choice. J. Symb. Log. 65(3): 1264-1310 (2000)
c10		Andreas Blass: Abstract State Machines and Pure Mathematics. Abstract State Machines 2000: 9-21
c9		Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines 2000: 22-33
c8		Andreas Blass, Yuri Gurevich: Background, Reserve, and Gandy Machines. CSL 2000: 1-17
c7		Andreas Blass, Yuri Gurevich: Choiceless Polynominal Time Computation and the Zero-One Law. CSL 2000: 18-40
	1999
j34		Andreas Blass, Yuri Gurevich, Saharon Shelah: Choiceless Polynomial Time. Ann. Pure Appl. Logic 100(1-3): 141-187 (1999)
j33		Andreas Blass, Heike Mildenberger: On The Confinality of Ultrapowers. J. Symb. Log. 64(2): 727-736 (1999)
	1998
j32		Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré: A Variation on the Zero-One Law. Inf. Process. Lett. 67(1): 29-30 (1998)
	1997
j31		Andreas Blass: Some Semantical Aspects of Linear Logic. Logic Journal of the IGPL 5(4): 487-503 (1997)
j30		Andreas Blass, Yuri Gurevich: The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. J. UCS 3(4): 247-278 (1997)
	1995
j29		Andreas Blass: An Induction Principle and Pigeonhole Principles for K-Finite Sets. J. Symb. Log. 60(4): 1186-1193 (1995)
j28		Andreas Blass, Yuri Gurevich: Matrix Transformation Is Complete for the Average Case. SIAM J. Comput. 24(1): 3-29 (1995)
	1994
j27		Andreas Blass: On exponentiation of G-sets. Discrete Mathematics 135(1-3): 69-79 (1994)
c6		Andreas Blass, Yuri Gurevich: Evolving Algebras and Linear Time Hierarchy. IFIP Congress (1) 1994: 383-390
	1993
j26		Andreas Blass, Yuri Gurevich: Randomizing Reductions of Search Problems. SIAM J. Comput. 22(5): 949-975 (1993)
c5		Andreas Blass: Is Game Semantics Necessary? CSL 1993: 66-77
	1992
j25		Andreas Blass: A Game Semantics for Linear Logic. Ann. Pure Appl. Logic 56(1-3): 183-220 (1992)
j24		Andreas Blass, Andre Scedrov: Complete Topoi Representing Models of Set Theory. Ann. Pure Appl. Logic 57(1): 1-26 (1992)
j23		Andreas Blass, Paul Erdös, Alan D. Taylor: Diverse Homogeneous Sets. J. Comb. Theory, Ser. A 59(2): 312-317 (1992)
	1991
c4		Andreas Blass, Yuri Gurevich: Randomizing Reductions of Search Problems. FSTTCS 1991: 10-24
	1990
j22		Andreas Blass: Infinitary Combinatorics and Modal Logic. J. Symb. Log. 55(2): 761-778 (1990)
c3		Andreas Blass, Yuri Gurevich: On the Reduction Theory for Average Case Complexity. CSL 1990: 17-30
	1989
j21		Andreas Blass, Yuri Gurevich: On Matijasevitch's Nontraditional Approach to Search Problems. Inf. Process. Lett. 32(1): 41-45 (1989)
j20		Andreas Blass, Claude Laflamme: Consistency Results About Filters and the Number of Inequivalent Growth Types. J. Symb. Log. 54(1): 50-56 (1989)
j19		Andreas Blass, Saharon Shelah: Near Coherence of Filters III: A Simplified Consistency Proof. Notre Dame Journal of Formal Logic 30(4): 530-538 (1989)
	1988
j18		Andreas Blass: Logic in Computer Ccience Column, guest authors. Bulletin of the EATCS 36: 57-65 (1988)
	1987
c2		Andreas Blass, Yuri Gurevich: Existential Fixed-Point Logic. Computation Theory and Logic 1987: 20-36
	1986
j17		Andreas Blass, Louise Hay, Peter G. Hinman: Meeting of the Association for Symbolic Logic: Chicago, 1985. J. Symb. Log. 51(2): 507-510 (1986)
j16		Andreas Blass, Andre Scedrov: Small Decidable Sheaves. J. Symb. Log. 51(3): 726-731 (1986)
	1985
j15		Andreas Blass, Yuri Gurevich, Dexter Kozen: A Zero-One Law for Logic with a Fixed-Point Operator. Information and Control 67(1-3): 70-90 (1985)
j14		Andreas Blass: Acknowledgement of Priority. J. Symb. Log. 50(3): 781 (1985)
	1984
j13		Andreas Blass: There are not Exactly Five Objects. J. Symb. Log. 49(2): 467-469 (1984)
j12		Andreas Blass, Yuri Gurevich: Equivalence Relations, Invariants, and Normal Forms. SIAM J. Comput. 13(4): 682-689 (1984)
	1983
c1		Andreas Blass, Yuri Gurevich: Equivalence relations, invariants, and normal forms. Logic and Machines 1983: 24-42
	1982
j11		Andreas Blass, Yuri Gurevich: On the Unique Satisfiability Problem. Information and Control 55(1-3): 80-88 (1982)
	1981
j10		Andreas Blass: Some Initial Segments of the Rudin-Keisler Ordering. J. Symb. Log. 46(1): 147-157 (1981)
j9		Andreas Blass: The Model of Set Theory Generated by Countably Many Generic Reals. J. Symb. Log. 46(4): 732-752 (1981)
	1980
j8		Andreas Blass, Frank Harary, Zevi Miller: Which trees are link graphs? J. Comb. Theory, Ser. B 29(3): 277-292 (1980)
	1977
j7		Andreas Blass: Amalgamation of Nonstandard Models of Arithmetic. J. Symb. Log. 42(3): 372-386 (1977)
j6		Andreas Blass: Ramsey's Theorem in the Hierarchy of Choice Principles. J. Symb. Log. 42(3): 387-390 (1977)
	1974
j5		Andreas Blass: On Certain Types and Models for Arithmetic. J. Symb. Log. 39(1): 151-162 (1974)
j4		Andreas Blass, Douglas A. Cenzer: Cores of pi¹₁ Sets of Reals. J. Symb. Log. 39(4): 649-654 (1974)
	1972
j3		Andreas Blass: The Intersection of Nonstandard Models of Arithmetic. J. Symb. Log. 37(1): 103-106 (1972)
j2		Andreas Blass: Theories without Countable Models. J. Symb. Log. 37(3): 562-568 (1972)
j1		Andreas Blass: On the Inadequacy of Inner Models. J. Symb. Log. 37(3): 569-571 (1972)

2011

j67

Andreas Blass, Yuri Gurevich: Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. 12(2): 16 (2011)

Andreas Blass, Yuri Gurevich: Zero-One Laws: Thesauri and Parametric Conditions. Proof, Computation and Agency 2011: 99-114

2010

j66

Andreas Blass, Yuri Gurevich, Efim Hudis: The Tower-of-Babel Problem, and Security Assesment Sharing. Bulletin of the EATCS 101: 161-182 (2010)

j65

Andreas Blass, Yuri Gurevich: Hilbertian Deductive Systems, Infon Logic, and Datalog. Bulletin of the EATCS 102: 122-150 (2010)

j64

Nikolaj Bjørner, Andreas Blass, Yuri Gurevich: Content-dependent chunking for differential compression, the local maximum approach. J. Comput. Syst. Sci. 76(3-4): 154-203 (2010)

c19

Andreas Blass, Nachum Dershowitz, Wolfgang Reisig: Yuri, Logic, and Computer Science. Fields of Logic and Computation 2010: 1-48

c18

Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman: Evidential Authorization. The Future of Software Engineering 2010: 73-99

c17

Andreas Blass: Existential Fixed-Point Logic, Universal Quantifiers, and Topoi. Fields of Logic and Computation 2010: 108-134

c16

Andreas Blass, Nachum Dershowitz, Yuri Gurevich: Exact Exploration and Hanging Algorithms. CSL 2010: 140-154

Andreas Blass, Nachum Dershowitz, Wolfgang Reisig (Eds.): Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday. Lecture Notes in Computer Science 6300, Springer 2010, isbn 978-3-642-15024-1

2009

j63

Andreas Blass, Su Gao, Yi Zhang: Preface. Ann. Pure Appl. Logic 158(3): 155 (2009)

j62

Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? Bulletin of Symbolic Logic 15(2): 145-168 (2009)

2008

j61

Andreas Blass, Yuri Gurevich: Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bulletin of the EATCS 95: 164-182 (2008)

j60

Andreas Blass, Yuri Gurevich: Program termination and well partial orderings. ACM Trans. Comput. Log. 9(3) (2008)

j59

Andreas Blass, Yuri Gurevich: Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. 9(3) (2008)

c15

Andreas Blass: Why Sets? Pillars of Computer Science 2008: 179-198

c14

Andreas Blass, Yuri Gurevich: One Useful Logic That Defines Its Own Truth. MFCS 2008: 1-15

Andreas Blass, Nachum Dershowitz, Yuri Gurevich: When are two algorithms the same? CoRR abs/0811.0811 (2008)

Andreas Blass, Yuri Gurevich: Persistent Queries. CoRR abs/0811.0819 (2008)

Andreas Blass, Yuri Gurevich: One useful logic that defines its own truth. CoRR abs/0811.0964 (2008)

Andreas Blass, Yuri Gurevich: Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. CoRR abs/0811.0977 (2008)

Nikolaj Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi: Modular difference logic is hard. CoRR abs/0811.0987 (2008)

2007

j58

Andreas Blass, Yuri Gurevich: Zero-One Laws: Thesauri and Parametric Conditions. Bulletin of the EATCS 91: 125-144 (2007)

j57

Andreas Blass, Yuri Gurevich: Background of Computation. Bulletin of the EATCS 92: 82-114 (2007)

j56

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization. Logical Methods in Computer Science 3(4) (2007)

j55

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Logical Methods in Computer Science 3(4) (2007)

j54

Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. 8(3) (2007)

j53

Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. 8(3) (2007)

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms I: Axiomatization. CoRR abs/0707.3782 (2007)

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman: Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. CoRR abs/0707.3789 (2007)

2006

j52

Andreas Blass, Yuri Gurevich: Ordinary interactive small-step algorithms, I. ACM Trans. Comput. Log. 7(2): 363-419 (2006)

c13

Andreas Blass: Adapting Logics. LICS 2006: 123

2005

j51

Andreas Blass, Gábor Braun: Random Orders and Gambler's Ruin. Electr. J. Comb. 12 (2005)

j50

Andreas Blass, Benjamin Rossman: Explicit Graphs with Extension Properties. Bulletin of the EATCS 86: 166-175 (2005)

c12

Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes: Play to Test. FATES 2005: 32-46

c11

Andreas Blass, Boris Mitavskiy: NP-Completeness of Deciding Binary Genetic Encodability. FOGA 2005: 58-74

2004

j49

Andreas Blass, Yuri Gurevich: Why Sets? (Column: Logic in Computer Science). Bulletin of the EATCS 84: 139-156 (2004)

2003

j48

Andreas Blass: Homotopy and Homology of Finite Lattices. Electr. J. Comb. 10 (2003)

j47

Andreas Blass, Yuri Gurevich: Algorithms: A Quest for Absolute Definitions. Bulletin of the EATCS 81: 195-225 (2003)

j46

Andreas Blass, Yuri Gurevich: Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. J. Symb. Log. 68(1): 65-131 (2003)

j45

Andreas Blass, Victor Pambuccian: Sperner spaces and first-order logic. Math. Log. Q. 49(2): 111-114 (2003)

j44

Andreas Blass, Yuri Gurevich: Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4): 578-651 (2003)

2002

j43

Andreas Blass, Yuri Gurevich: Algorithms vs. Machines. Bulletin of the EATCS 77: 96-119 (2002)

j42

Andreas Blass, Yuri Gurevich: Pairwise Testing. Bulletin of the EATCS 78: 100-132 (2002)

j41

Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174(1): 20-36 (2002)

j40

Andreas Blass, Yuri Gurevich, Saharon Shelah: On Polynomial Time Computation over Unordered Structures. J. Symb. Log. 67(3): 1093-1125 (2002)

2001

j39

Andreas Blass: Needed reals and recursion in generic reals. Ann. Pure Appl. Logic 109(1-2): 77-88 (2001)

j38

Andreas Blass, Yuri Gurevich: Inadequacy of computable loop invariants. ACM Trans. Comput. Log. 2(1): 1-11 (2001)

Andreas Blass, Yuri Gurevich: The Underlying Logic of Hoare Logic. Current Trends in Theoretical Computer Science 2001: 409-436

2000

j37

Andreas Blass, Yuri Gurevich: The Underlying Logic of Hoare Logic. Bulletin of the EATCS 70: 82-111 (2000)

j36

Andreas Blass, Yuri Gurevich: A New Zero-One Law and Strong Extension Axioms. Bulletin of the EATCS 72: 103-122 (2000)

j35

Andreas Blass, Yuri Gurevich: The Logic of Choice. J. Symb. Log. 65(3): 1264-1310 (2000)

c10

Andreas Blass: Abstract State Machines and Pure Mathematics. Abstract State Machines 2000: 9-21

Andreas Blass, Yuri Gurevich, Jan Van den Bussche: Abstract State Machines and Computationally Complete Query Languages. Abstract State Machines 2000: 22-33

Andreas Blass, Yuri Gurevich: Background, Reserve, and Gandy Machines. CSL 2000: 1-17

Andreas Blass, Yuri Gurevich: Choiceless Polynominal Time Computation and the Zero-One Law. CSL 2000: 18-40

1999

j34

Andreas Blass, Yuri Gurevich, Saharon Shelah: Choiceless Polynomial Time. Ann. Pure Appl. Logic 100(1-3): 141-187 (1999)

j33

Andreas Blass, Heike Mildenberger: On The Confinality of Ultrapowers. J. Symb. Log. 64(2): 727-736 (1999)

1998

j32

Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré: A Variation on the Zero-One Law. Inf. Process. Lett. 67(1): 29-30 (1998)

1997

j31

Andreas Blass: Some Semantical Aspects of Linear Logic. Logic Journal of the IGPL 5(4): 487-503 (1997)

j30

Andreas Blass, Yuri Gurevich: The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. J. UCS 3(4): 247-278 (1997)

1995

j29

Andreas Blass: An Induction Principle and Pigeonhole Principles for K-Finite Sets. J. Symb. Log. 60(4): 1186-1193 (1995)

j28

Andreas Blass, Yuri Gurevich: Matrix Transformation Is Complete for the Average Case. SIAM J. Comput. 24(1): 3-29 (1995)

1994

j27

Andreas Blass: On exponentiation of G-sets. Discrete Mathematics 135(1-3): 69-79 (1994)

Andreas Blass, Yuri Gurevich: Evolving Algebras and Linear Time Hierarchy. IFIP Congress (1) 1994: 383-390

1993

j26

Andreas Blass, Yuri Gurevich: Randomizing Reductions of Search Problems. SIAM J. Comput. 22(5): 949-975 (1993)

Andreas Blass: Is Game Semantics Necessary? CSL 1993: 66-77

1992

j25

Andreas Blass: A Game Semantics for Linear Logic. Ann. Pure Appl. Logic 56(1-3): 183-220 (1992)

j24

Andreas Blass, Andre Scedrov: Complete Topoi Representing Models of Set Theory. Ann. Pure Appl. Logic 57(1): 1-26 (1992)

j23

Andreas Blass, Paul Erdös, Alan D. Taylor: Diverse Homogeneous Sets. J. Comb. Theory, Ser. A 59(2): 312-317 (1992)

1991

Andreas Blass, Yuri Gurevich: Randomizing Reductions of Search Problems. FSTTCS 1991: 10-24

1990

j22

Andreas Blass: Infinitary Combinatorics and Modal Logic. J. Symb. Log. 55(2): 761-778 (1990)

Andreas Blass, Yuri Gurevich: On the Reduction Theory for Average Case Complexity. CSL 1990: 17-30

1989

j21

Andreas Blass, Yuri Gurevich: On Matijasevitch's Nontraditional Approach to Search Problems. Inf. Process. Lett. 32(1): 41-45 (1989)

j20

Andreas Blass, Claude Laflamme: Consistency Results About Filters and the Number of Inequivalent Growth Types. J. Symb. Log. 54(1): 50-56 (1989)

j19

Andreas Blass, Saharon Shelah: Near Coherence of Filters III: A Simplified Consistency Proof. Notre Dame Journal of Formal Logic 30(4): 530-538 (1989)

1988

j18

Andreas Blass: Logic in Computer Ccience Column, guest authors. Bulletin of the EATCS 36: 57-65 (1988)

1987

Andreas Blass, Yuri Gurevich: Existential Fixed-Point Logic. Computation Theory and Logic 1987: 20-36

1986

j17

Andreas Blass, Louise Hay, Peter G. Hinman: Meeting of the Association for Symbolic Logic: Chicago, 1985. J. Symb. Log. 51(2): 507-510 (1986)

j16

Andreas Blass, Andre Scedrov: Small Decidable Sheaves. J. Symb. Log. 51(3): 726-731 (1986)

1985

j15

Andreas Blass, Yuri Gurevich, Dexter Kozen: A Zero-One Law for Logic with a Fixed-Point Operator. Information and Control 67(1-3): 70-90 (1985)

j14

Andreas Blass: Acknowledgement of Priority. J. Symb. Log. 50(3): 781 (1985)

1984

j13

Andreas Blass: There are not Exactly Five Objects. J. Symb. Log. 49(2): 467-469 (1984)

j12

Andreas Blass, Yuri Gurevich: Equivalence Relations, Invariants, and Normal Forms. SIAM J. Comput. 13(4): 682-689 (1984)

1983

Andreas Blass, Yuri Gurevich: Equivalence relations, invariants, and normal forms. Logic and Machines 1983: 24-42

1982

j11

Andreas Blass, Yuri Gurevich: On the Unique Satisfiability Problem. Information and Control 55(1-3): 80-88 (1982)

1981

j10

Andreas Blass: Some Initial Segments of the Rudin-Keisler Ordering. J. Symb. Log. 46(1): 147-157 (1981)

Andreas Blass: The Model of Set Theory Generated by Countably Many Generic Reals. J. Symb. Log. 46(4): 732-752 (1981)

1980

Andreas Blass, Frank Harary, Zevi Miller: Which trees are link graphs? J. Comb. Theory, Ser. B 29(3): 277-292 (1980)

1977

Andreas Blass: Amalgamation of Nonstandard Models of Arithmetic. J. Symb. Log. 42(3): 372-386 (1977)

Andreas Blass: Ramsey's Theorem in the Hierarchy of Choice Principles. J. Symb. Log. 42(3): 387-390 (1977)

1974

Andreas Blass: On Certain Types and Models for Arithmetic. J. Symb. Log. 39(1): 151-162 (1974)

Andreas Blass, Douglas A. Cenzer: Cores of pi¹₁ Sets of Reals. J. Symb. Log. 39(4): 649-654 (1974)

1972

Andreas Blass: The Intersection of Nonstandard Models of Arithmetic. J. Symb. Log. 37(1): 103-106 (1972)

Andreas Blass: Theories without Countable Models. J. Symb. Log. 37(3): 562-568 (1972)

Andreas Blass: On the Inadequacy of Inner Models. J. Symb. Log. 37(3): 569-571 (1972)

1	Nikolaj Bjørner	[j64] [i3]
2	Gábor Braun	[j51]
3	Jan Van den Bussche	[j41] [c9]
4	Douglas A. Cenzer (Douglas Cenzer)	[j4]
5	Nachum Dershowitz	[c19] [c16] [e1] [j62] [i7]
6	Paul Erdös	[j23]
7	Su Gao	[j63]
8	Yuri Gurevich	[j67] [p2] [j66] [j65] [j64] [c18] [c16] [j62] [j61] [j60] [j59] [c14] [i7] [i6] [i5] [i4] [i3] [j58] [j57] [j56] [j55] [j54] [j53] [i2] [i1] [j52] [c12] [j49] [j47] [j46] [j44] [j43] [j42] [j41] [j40] [j38] [p1] [j37] [j36] [j35] [c9] [c8] [c7] [j34] [j32] [j30] [j28] [c6] [j26] [c4] [c3] [j21] [c2] [j15] [j12] [c1] [j11]
9	Frank Harary	[j8]
10	Louise Hay	[j17]
11	Peter G. Hinman	[j17]
12	Efim Hudis	[j66]
13	Dexter Kozen	[j15]
14	Vladik Kreinovich	[j32]
15	Claude Laflamme	[j20]
16	Luc Longpré	[j32]
17	Heike Mildenberger	[j33]
18	Zevi Miller	[j8]
19	Boris Mitavskiy	[c11]
20	Michal Moskal	[c18]
21	Madan Musuvathi	[i3]
22	Lev Nachmanson	[c12]
23	Itay Neeman	[c18]
24	Victor Pambuccian	[j45]
25	Wolfgang Reisig	[c19] [e1]
26	Dean Rosenzweig	[j56] [j55] [i2] [i1]
27	Benjamin Rossman	[j56] [j55] [i2] [i1] [j50]
28	Andre Scedrov	[j24] [j16]
29	Saharon Shelah	[j40] [j34] [j19]
30	Alan D. Taylor	[j23]
31	Margus Veanes	[c12]
32	Yi Zhang 0008	[j63]

Andreas Blass

Coauthor Index