| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Andreas Blass, Yuri Gurevich |
Persistent queries in the behavioral theory of algorithms.  |
ACM Trans. Comput. Log.  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Zero-One Laws: Thesauri and Parametric Conditions. |
Proof, Computation and Agency |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Efim Hudis |
The Tower-of-Babel Problem, and Security Assesment Sharing. |
Bulletin of the EATCS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Hilbertian Deductive Systems, Infon Logic, and Datalog. |
Bulletin of the EATCS |
2010 |
DBLP BibTeX RDF |
|
| 1 | Nikolaj Bjørner, Andreas Blass, Yuri Gurevich |
Content-dependent chunking for differential compression, the local maximum approach. |
J. Comput. Syst. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Nachum Dershowitz, Wolfgang Reisig (eds.) |
Fields of Logic and Computation, Essays Dedicated to Yuri Gurevich on the Occasion of His 70th Birthday |
Fields of Logic and Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
Existential Fixed-Point Logic, Universal Quantifiers, and Topoi. |
Fields of Logic and Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman |
Evidential Authorization. |
The Future of Software Engineering |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Nachum Dershowitz, Wolfgang Reisig |
Yuri, Logic, and Computer Science. |
Fields of Logic and Computation |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Nachum Dershowitz, Yuri Gurevich |
Exact Exploration and Hanging Algorithms. |
CSL |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Nachum Dershowitz, Yuri Gurevich |
When are two algorithms the same? |
Bulletin of Symbolic Logic |
2009 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Su Gao, Yi Zhang 0008 |
Preface. |
Ann. Pure Appl. Logic |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
One useful logic that defines its own truth |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Nikolaj Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi |
Modular difference logic is hard |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Persistent Queries |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Nachum Dershowitz, Yuri Gurevich |
When are two algorithms the same? |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. |
Bulletin of the EATCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Abstract state machines capture parallel algorithms: Correction and extension. |
ACM Trans. Comput. Log. |
2008 |
DBLP DOI BibTeX RDF |
ASM thesis, postulates for parallel computation, Parallel algorithm, parallel programming, abstract state machine |
| 1 | Andreas Blass, Yuri Gurevich |
Program termination and well partial orderings. |
ACM Trans. Comput. Log. |
2008 |
DBLP DOI BibTeX RDF |
covering observation, game criterion, well partial orderings, Program termination |
| 1 | Andreas Blass, Yuri Gurevich |
One Useful Logic That Defines Its Own Truth. |
MFCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
Why Sets? |
Pillars of Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman |
Interactive Small-Step Algorithms I: Axiomatization. |
Logical Methods in Computer Science |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman |
Interactive Small-Step Algorithms I: Axiomatization |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman |
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Zero-One Laws: Thesauri and Parametric Conditions. |
Bulletin of the EATCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Background of Computation. |
Bulletin of the EATCS |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Ordinary interactive small-step algorithms, II. |
ACM Trans. Comput. Log. |
2007 |
DBLP DOI BibTeX RDF |
equivalence of algorithms, postulates, interaction, abstract state machines, Sequential algorithms |
| 1 | Andreas Blass, Yuri Gurevich |
Ordinary interactive small-step algorithms, III. |
ACM Trans. Comput. Log. |
2007 |
DBLP DOI BibTeX RDF |
equivalence of algorithms, postulates, interaction, abstract state machines, Sequential algorithms |
| 1 | Andreas Blass, Yuri Gurevich |
Ordinary interactive small-step algorithms, I. |
ACM Trans. Comput. Log. |
2006 |
DBLP DOI BibTeX RDF |
equivalence of algorithms, postulates, interaction, abstract state machines, Sequential algorithms |
| 1 | Andreas Blass |
Adapting Logics. |
LICS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Gábor Braun |
Random Orders and Gambler's Ruin. |
Electr. J. Comb. |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Benjamin Rossman |
Explicit Graphs with Extension Properties. |
Bulletin of the EATCS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Boris Mitavskiy |
NP-Completeness of Deciding Binary Genetic Encodability. |
FOGA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes |
Play to Test. |
FATES |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Why Sets? (Column: Logic in Computer Science). |
Bulletin of the EATCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Victor Pambuccian |
Sperner spaces and first-order logic. |
Math. Log. Q. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Strong extension axioms and Shelah's zero-one law for choiceless polynomial time. |
J. Symb. Log. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
Homotopy and Homology of Finite Lattices. |
Electr. J. Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Algorithms: A Quest for Absolute Definitions. |
Bulletin of the EATCS |
2003 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Abstract state machines capture parallel algorithms. |
ACM Trans. Comput. Log. |
2003 |
DBLP DOI BibTeX RDF |
ASM thesis, postulates for parallel computation, Parallel algorithm, abstract state machine |
| 1 | Andreas Blass, Yuri Gurevich, Jan Van den Bussche |
Abstract State Machines and Computationally Complete Query Languages. |
Inf. Comput. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Saharon Shelah |
On Polynomial Time Computation over Unordered Structures. |
J. Symb. Log. |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Pairwise Testing. |
Bulletin of the EATCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Algorithms vs. Machines. |
Bulletin of the EATCS |
2002 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
Needed reals and recursion in generic reals. |
Ann. Pure Appl. Logic |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Inadequacy of computable loop invariants. |
ACM Trans. Comput. Log. |
2001 |
DBLP DOI BibTeX RDF |
postcondition uncomputable, recursive inseparability, assertion, automated reasoning, precondition, Hoare logic, automated deduction, loop invariants |
| 1 | Andreas Blass, Yuri Gurevich |
The Underlying Logic of Hoare Logic. |
Current Trends in Theoretical Computer Science |
2001 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
The Logic of Choice. |
J. Symb. Log. |
2000 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
The Underlying Logic of Hoare Logic. |
Bulletin of the EATCS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
A New Zero-One Law and Strong Extension Axioms. |
Bulletin of the EATCS |
2000 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Choiceless Polynominal Time Computation and the Zero-One Law. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Background, Reserve, and Gandy Machines. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Jan Van den Bussche |
Abstract State Machines and Computationally Complete Query Languages. |
Abstract State Machines |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
Abstract State Machines and Pure Mathematics. |
Abstract State Machines |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Heike Mildenberger |
On The Confinality of Ultrapowers. |
J. Symb. Log. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Saharon Shelah |
Choiceless Polynomial Time. |
Ann. Pure Appl. Logic |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré |
A Variation on the Zero-One Law. |
Inf. Process. Lett. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
Some Semantical Aspects of Linear Logic. |
Logic Journal of the IGPL |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. |
J. UCS |
1997 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
An Induction Principle and Pigeonhole Principles for K-Finite Sets. |
J. Symb. Log. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Matrix Transformation Is Complete for the Average Case. |
SIAM J. Comput. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
On exponentiation of G-sets. |
Discrete Mathematics |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Evolving Algebras and Linear Time Hierarchy. |
IFIP Congress |
1994 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Randomizing Reductions of Search Problems. |
SIAM J. Comput. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
Is Game Semantics Necessary? |
CSL |
1993 |
DBLP DOI BibTeX RDF |
1991 Mathematics Subject Classification 03B60 |
| 1 | Andreas Blass, Paul Erdös, Alan D. Taylor |
Diverse Homogeneous Sets. |
J. Comb. Theory, Ser. A |
1992 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Andre Scedrov |
Complete Topoi Representing Models of Set Theory. |
Ann. Pure Appl. Logic |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
A Game Semantics for Linear Logic. |
Ann. Pure Appl. Logic |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Randomizing Reductions of Search Problems. |
FSTTCS |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
Infinitary Combinatorics and Modal Logic. |
J. Symb. Log. |
1990 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
On the Reduction Theory for Average Case Complexity. |
CSL |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
On Matijasevitch's Nontraditional Approach to Search Problems. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Saharon Shelah |
Near Coherence of Filters III: A Simplified Consistency Proof. |
Notre Dame Journal of Formal Logic |
1989 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Claude Laflamme |
Consistency Results About Filters and the Number of Inequivalent Growth Types. |
J. Symb. Log. |
1989 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
Logic in Computer Ccience Column, guest authors. |
Bulletin of the EATCS |
1988 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Existential Fixed-Point Logic. |
Computation Theory and Logic |
1987 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Andre Scedrov |
Small Decidable Sheaves. |
J. Symb. Log. |
1986 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Louise Hay, Peter G. Hinman |
Meeting of the Association for Symbolic Logic: Chicago, 1985. |
J. Symb. Log. |
1986 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich, Dexter Kozen |
A Zero-One Law for Logic with a Fixed-Point Operator |
Information and Control |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
Acknowledgement of Priority. |
J. Symb. Log. |
1985 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
There are not Exactly Five Objects. |
J. Symb. Log. |
1984 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Equivalence Relations, Invariants, and Normal Forms. |
SIAM J. Comput. |
1984 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
Equivalence relations, invariants, and normal forms. |
Logic and Machines |
1983 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass, Yuri Gurevich |
On the Unique Satisfiability Problem |
Information and Control |
1982 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
The Model of Set Theory Generated by Countably Many Generic Reals. |
J. Symb. Log. |
1981 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
Some Initial Segments of the Rudin-Keisler Ordering. |
J. Symb. Log. |
1981 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Frank Harary, Zevi Miller |
Which trees are link graphs? |
J. Comb. Theory, Ser. B |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Blass |
Ramsey's Theorem in the Hierarchy of Choice Principles. |
J. Symb. Log. |
1977 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
Amalgamation of Nonstandard Models of Arithmetic. |
J. Symb. Log. |
1977 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass, Douglas A. Cenzer |
Cores of pi11 Sets of Reals. |
J. Symb. Log. |
1974 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
On Certain Types and Models for Arithmetic. |
J. Symb. Log. |
1974 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
The Intersection of Nonstandard Models of Arithmetic. |
J. Symb. Log. |
1972 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
Theories without Countable Models. |
J. Symb. Log. |
1972 |
DBLP BibTeX RDF |
|
| 1 | Andreas Blass |
On the Inadequacy of Inner Models. |
J. Symb. Log. |
1972 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")