Andreas Blass

According to our database, Andreas Blass authored at least 127 papers between 1972 and 2023.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of one.

2023

Software science view on quantum circuit algorithms.

Yuri Gurevich, Andreas Blass

Inf. Comput., June, 2023

What are kets?

Yuri Gurevich, Andreas Blass

Bull. EATCS, 2023

Primal logic of information.

Yuri Gurevich, Andreas Blass

CoRR, 2023

2022

Quantum circuits with classical channels and the principle of deferred measurements.

Yuri Gurevich, Andreas Blass

Theor. Comput. Sci., 2022

Wigner's quasidistribution and Dirac's kets.

Andreas Blass, Yuri Gurevich, Alexander Volberg

Bull. EATCS, 2022

2021

Simple circuit simulations of classical and quantum Turing machines.

Yuri Gurevich, Andreas Blass

CoRR, 2021

2020

Braided distributivity.

Andreas Blass, Yuri Gurevich

Theor. Comput. Sci., 2020

Witness algebra and anyon braiding.

Andreas Blass, Yuri Gurevich

Math. Struct. Comput. Sci., 2020

Circuits: An abstract viewpoint.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2020

Negative probabilities: What they are and what they are for.

Andreas Blass, Yuri Gurevich

CoRR, 2020

Functional Thesauri, Classifying Topoi, Unification, and Flatness.

Andreas Blass

Proceedings of the Fields of Logic and Computation III, 2020

2019

Circuit pedantry.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2019

2018

An Invitation to Quantum Computing.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2018

Negative probabilities, II What they are and what they are for.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2018

Who needs category theory?

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2018

Coherence for braided distributivity.

Andreas Blass, Yuri Gurevich

CoRR, 2018

2017

On the Rectilinear Steiner Problem.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2017

Common Denominator for Value and Expectation No-go Theorems: Extended Abstract.

Andreas Blass, Yuri Gurevich

Proceedings of the Proceedings 14th International Conference on Quantum Physics and Logic, 2017

2016

Symbioses between mathematical logic and computer science.

Andreas Blass

Ann. Pure Appl. Log., 2016

On Quantum Computation, Anyons, and Categories.

Andreas Blass, Yuri Gurevich

Proceedings of the Martin Davis on Computability, 2016

Introduction to Secret-Sharing.

Andreas Blass

Proceedings of the Dependence Logic, Theory and Applications, 2016

2015

The Next Best Thing to a P-Point.

Andreas Blass, Natasha Dobrinen, Dilip Raghavan

J. Symb. Log., 2015

Negative Probability.

Andreas Blass

Bull. EATCS, 2015

Existential Fixed-Point Logic as a Fragment of Second-Order Logic.

Andreas Blass

Proceedings of the Fields of Logic and Computation II, 2015

2013

Abstract Hilbertian deductive systems, infon logic, and Datalog.

Andreas Blass, Yuri Gurevich

Inf. Comput., 2013

2011

Persistent queries in the behavioral theory of algorithms.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2011

Zero-One Laws: Thesauri and Parametric Conditions.

Andreas Blass, Yuri Gurevich

Proceedings of the Proof, Computation and Agency - Logic at the Crossroads., 2011

2010

Content-dependent chunking for differential compression, the local maximum approach.

Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich

J. Comput. Syst. Sci., 2010

The Tower-of-Babel Problem, and Security Assesment Sharing.

Andreas Blass, Yuri Gurevich, Efim Hudis

Bull. EATCS, 2010

Hilbertian Deductive Systems, Infon Logic, and Datalog.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2010

Exact Exploration and Hanging Algorithms.

Andreas Blass, Nachum Dershowitz, Yuri Gurevich

Proceedings of the Computer Science Logic, 24th International Workshop, 2010

Evidential Authorization.

Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman

Proceedings of the Future of Software Engineering., 2010

Yuri, Logic, and Computer Science.

Andreas Blass, Nachum Dershowitz, Wolfgang Reisig

Proceedings of the Fields of Logic and Computation, 2010

Existential Fixed-Point Logic, Universal Quantifiers, and Topoi.

Andreas Blass

Proceedings of the Fields of Logic and Computation, 2010

2009

When are two algorithms the same?

Andreas Blass, Nachum Dershowitz, Yuri Gurevich

Bull. Symb. Log., 2009

Preface.

Andreas Blass, Su Gao, Yi Zhang

Ann. Pure Appl. Log., 2009

Partitions and Permutation Groups.

Andreas Blass

Proceedings of the Model Theoretic Methods in Finite Combinatorics, 2009

2008

Abstract state machines capture parallel algorithms: Correction and extension.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2008

Program termination and well partial orderings.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2008

Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2008

Modular difference logic is hard

Nikolaj S. Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi

CoRR, 2008

Persistent Queries

Andreas Blass, Yuri Gurevich

CoRR, 2008

One Useful Logic That Defines Its Own Truth.

Andreas Blass, Yuri Gurevich

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

Why Sets?

Andreas Blass, Yuri Gurevich

Proceedings of the Pillars of Computer Science, 2008

2007

Ordinary interactive small-step algorithms, III.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2007

Ordinary interactive small-step algorithms, II.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2007

Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem.

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman

Log. Methods Comput. Sci., 2007

Interactive Small-Step Algorithms I: Axiomatization.

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman

Log. Methods Comput. Sci., 2007

Background of Computation.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2007

Zero-One Laws: Thesauri and Parametric Conditions.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2007

2006

Ordinary interactive small-step algorithms, I.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2006

Adapting Logics.

Andreas Blass

Proceedings of the 21th IEEE Symposium on Logic in Computer Science (LICS 2006), 2006

2005

Divisibility of Dedekind finite Sets.

David Blair, Andreas Blass, Paul E. Howard

J. Math. Log., 2005

Explicit Graphs with Extension Properties.

Andreas Blass, Benjamin Rossman

Bull. EATCS, 2005

Random Orders and Gambler's Ruin.

Andreas Blass, Gábor Braun

Electron. J. Comb., 2005

NP-Completeness of Deciding Binary Genetic Encodability.

Andreas Blass, Boris Mitavskiy

Proceedings of the Foundations of Genetic Algorithms, 8th International Workshop, 2005

Play to Test.

Andreas Blass, Yuri Gurevich, Lev Nachmanson, Margus Veanes

Proceedings of the Formal Approaches to Software Testing, 5th International Workshop, 2005

2004

Why Sets? (Column: Logic in Computer Science).

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2004

2003

Abstract state machines capture parallel algorithms.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2003

Sperner spaces and first-order logic.

Andreas Blass, Victor Pambuccian

Math. Log. Q., 2003

Strong extension axioms and Shelah's zero-one law for choiceless polynomial time.

Andreas Blass, Yuri Gurevich

J. Symb. Log., 2003

Algorithms: A Quest for Absolute Definitions.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2003

Homotopy and Homology of Finite Lattices.

Andreas Blass

Electron. J. Comb., 2003

2002

On Polynomial Time Computation over Unordered Structures.

Andreas Blass, Yuri Gurevich, Saharon Shelah

J. Symb. Log., 2002

Abstract State Machines and Computationally Complete Query Languages.

Andreas Blass, Yuri Gurevich, Jan Van den Bussche

Inf. Comput., 2002

Algorithms vs. Machines.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2002

Pairwise Testing.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2002

2001

Inadequacy of computable loop invariants.

Andreas Blass, Yuri Gurevich

ACM Trans. Comput. Log., 2001

Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187.

Andreas Blass, Yuri Gurevich, Saharon Shelah

Ann. Pure Appl. Log., 2001

Needed reals and recursion in generic reals.

Andreas Blass

Ann. Pure Appl. Log., 2001

The Underlying Logic of Hoare Logic.

Andreas Blass, Yuri Gurevich

Proceedings of the Current Trends in Theoretical Computer Science, 2001

2000

The Logic of Choice.

Andreas Blass, Yuri Gurevich

J. Symb. Log., 2000

The Underlying Logic of Hoare Logic.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2000

A New Zero-One Law and Strong Extension Axioms.

Andreas Blass, Yuri Gurevich

Bull. EATCS, 2000

Choiceless Polynominal Time Computation and the Zero-One Law.

Andreas Blass, Yuri Gurevich

Proceedings of the Computer Science Logic, 2000

Background, Reserve, and Gandy Machines.

Andreas Blass, Yuri Gurevich

Proceedings of the Computer Science Logic, 2000

Abstract State Machines and Pure Mathematics.

Andreas Blass

Proceedings of the Abstract State Machines, 2000

1999

On The Confinality of Ultrapowers.

Andreas Blass, Heike Mildenberger

J. Symb. Log., 1999

Choiceless Polynomial Time.

Andreas Blass, Yuri Gurevich, Saharon Shelah

Ann. Pure Appl. Log., 1999

1998

A Variation on the Zero-One Law.

Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré

Inf. Process. Lett., 1998

1997

The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs.

Andreas Blass, Yuri Gurevich

J. Univers. Comput. Sci., 1997

Some Semantical Aspects of Linear Logic.

Andreas Blass

Log. J. IGPL, 1997

1995

Matrix Transformation Is Complete for the Average Case.

Andreas Blass, Yuri Gurevich

SIAM J. Comput., 1995

An Induction Principle and Pigeonhole Principles for K-Finite Sets.

Andreas Blass

J. Symb. Log., 1995

1994

On exponentiation of G-sets.

Andreas Blass

Discret. Math., 1994

Evolving Algebras and Linear Time Hierarchy.

Andreas Blass, Yuri Gurevich

Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993

Topoi and Computation.

Andreas Blass

Proceedings of the Current Trends in Theoretical Computer Science - Essays and Tutorials, 1993

Randomizing Reductions of Search Problems.

Andreas Blass, Yuri Gurevich

SIAM J. Comput., 1993

Is Game Semantics Necessary?

Andreas Blass

Proceedings of the Computer Science Logic, 7th Workshop, 1993

1992

Diverse Homogeneous Sets.

Andreas Blass, Paul Erdös, Alan D. Taylor

J. Comb. Theory, Ser. A, 1992

Complete Topoi Representing Models of Set Theory.

Andreas Blass, Andre Scedrov

Ann. Pure Appl. Log., 1992

A Game Semantics for Linear Logic.

Andreas Blass

Ann. Pure Appl. Log., 1992

1990

Infinitary Combinatorics and Modal Logic.

Andreas Blass

J. Symb. Log., 1990

Groupwise density and related cardinals.

Andreas Blass

Arch. Math. Log., 1990

On the Reduction Theory for Average Case Complexity.

Andreas Blass, Yuri Gurevich

Proceedings of the Computer Science Logic, 4th Workshop, 1990

1989

Near Coherence of Filters III: A Simplified Consistency Proof.

Andreas Blass, Saharon Shelah

Notre Dame J. Formal Log., 1989

Consistency Results About Filters and the Number of Inequivalent Growth Types.

Andreas Blass, Claude Laflamme

J. Symb. Log., 1989

On Matijasevitch's Nontraditional Approach to Search Problems.

Andreas Blass, Yuri Gurevich

Inf. Process. Lett., 1989

1988

Logic in Computer Ccience Column, guest authors.

Andreas Blass

Bull. EATCS, 1988

Selective ultrafilters and homogeneity.

Andreas Blass

Ann. Pure Appl. Log., 1988

1987

There may be simple Paleph₁ and Paleph₂-points and the Rudin-Keisler ordering may be downward directed.

Andreas Blass, Saharon Shelah

Ann. Pure Appl. Log., 1987

Existential Fixed-Point Logic.

Andreas Blass, Yuri Gurevich

Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986

Near coherence of filters. I. Cofinal equivalence of models of arithmetic.

Andreas Blass

Notre Dame J. Formal Log., 1986

Small Decidable Sheaves.

Andreas Blass, Andre Scedrov

J. Symb. Log., 1986

Meeting of the Association for Symbolic Logic: Chicago, 1985.

Andreas Blass, Louise Hay, Peter G. Hinman

J. Symb. Log., 1986

Bijective proofs of two broken circuit theorems.

Andreas Blass, Bruce E. Sagan

J. Graph Theory, 1986

Henkin quantifiers and complete problems.

Andreas Blass, Yuri Gurevich

Ann. Pure Appl. Log., 1986

1985

Acknowledgement of Priority.

Andreas Blass

J. Symb. Log., 1985

A Zero-One Law for Logic with a Fixed-Point Operator

Andreas Blass, Yuri Gurevich, Dexter Kozen

Inf. Control., 1985

1984

Equivalence Relations, Invariants, and Normal Forms.

Andreas Blass, Yuri Gurevich

SIAM J. Comput., 1984

There are not Exactly Five Objects.

Andreas Blass

J. Symb. Log., 1984

1982

On the Unique Satisfiability Problem

Andreas Blass, Yuri Gurevich

Inf. Control., 1982

1981

The Model of Set Theory Generated by Countably Many Generic Reals.

Andreas Blass

J. Symb. Log., 1981

Some Initial Segments of the Rudin-Keisler Ordering.

Andreas Blass

J. Symb. Log., 1981

Paley graphs satisfy all first-order adjacency axioms.

Andreas Blass, Geoffrey Exoo, Frank Harary

J. Graph Theory, 1981

1980

Which trees are link graphs?

Andreas Blass, Frank Harary, Zevi Miller

J. Comb. Theory, Ser. B, 1980

Conservative extensions of models of arithmetic.

Andreas Blass

Arch. Math. Log., 1980

1979

Properties of almost all graphs and complexes.

Andreas Blass, Frank Harary

J. Graph Theory, 1979

1978

Graphs with unique maximal clumpings.

Andreas Blass

J. Graph Theory, 1978

1977

Ramsey's Theorem in the Hierarchy of Choice Principles.

Andreas Blass

J. Symb. Log., 1977

Amalgamation of Nonstandard Models of Arithmetic.

Andreas Blass

J. Symb. Log., 1977

1974

Cores of pi¹₁ Sets of Reals.

Andreas Blass, Douglas A. Cenzer

J. Symb. Log., 1974

On Certain Types and Models for Arithmetic.

Andreas Blass

J. Symb. Log., 1974

1972

On the Inadequacy of Inner Models.

Andreas Blass

J. Symb. Log., 1972

Theories without Countable Models.

Andreas Blass

J. Symb. Log., 1972

The Intersection of Nonstandard Models of Arithmetic.

Andreas Blass

J. Symb. Log., 1972

Complexity of winning strategies.

Andreas Blass

Discret. Math., 1972