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