Andreas Blass

发表

Complexity of winning strategies

Andreas Blass, 1972, Discret. Math..

Persistent queries in the behavioral theory of algorithms

Andreas Blass, Yuri Gurevich, 2011, TOCL.

The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs

Andreas Blass, Yuri Gurevich, 1997, J. Univers. Comput. Sci..

Abstract State Machines and Pure Mathematics

Andreas Blass, A. Blass, 2000, Abstract State Machines.

Abstract Hilbertian deductive systems, infon logic, and Datalog

Andreas Blass, Yuri Gurevich, 2013, Inf. Comput..

When are Two Algorithms the Same? pdf

Nachum Dershowitz, Andreas Blass, Yuri Gurevich, 2008, The Bulletin of Symbolic Logic.

Yuri, Logic, and Computer Science

Wolfgang Reisig, Nachum Dershowitz, Andreas Blass, 2010, Fields of Logic and Computation.

Henkin quantifiers and complete problems

Andreas Blass, Yuri Gurevich, Y. Gurevich, 1986, Ann. Pure Appl. Log..

Consistency results about filters and the number of inequivalent growth types

Andreas Blass, Claude Laflamme, C. Laflamme, 1989, Journal of Symbolic Logic.

Abstract State Machines and Computationally Complete Query Languages

Jan Van den Bussche, Andreas Blass, Yuri Gurevich, 2002, Inf. Comput..

Preface

Yi Zhang, Andreas Blass, Su Gao, 2009, Ann. Pure Appl. Log..

Paley graphs satisfy all first-order adjacency axioms

Frank Harary, Andreas Blass, Geoffrey Exoo, 1981, J. Graph Theory.

Selective ultrafilters and homogeneity

Andreas Blass, A. Blass, 1988, Ann. Pure Appl. Log..

On the Inadequacy of Inner Models

Andreas Blass, 1972, J. Symb. Log..

Which trees are link graphs?

Frank Harary, Zevi Miller, Andreas Blass, 1980, J. Comb. Theory, Ser. B.

Ordinary interactive small-step algorithms, I

Andreas Blass, Yuri Gurevich, 2006, TOCL.

Evidential Authorization

Andreas Blass, Yuri Gurevich, Michal Moskal, 2010, The Future of Software Engineering.

Ordinary interactive small-step algorithms, III

Andreas Blass, Yuri Gurevich, 2007, TOCL.

Diverse Homogeneous Sets

Paul Erdös, Andreas Blass, Alan D. Taylor, 1992, J. Comb. Theory, Ser. A.

Why Sets?

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2008, Pillars of Computer Science.

Pairwise Testing

Andreas Blass, Yuri Gurevich, 2002, Bull. EATCS.

Infinitary combinatorics and modal logic

Andreas Blass, A. Blass, 1990, Journal of Symbolic Logic.

Some Initial Segments of the Rudin-Keisler Ordering

Andreas Blass, 1981, J. Symb. Log..

Matrix Transformation Is Complete for the Average Case

Andreas Blass, Yuri Gurevich, 1995, SIAM J. Comput..

Algorithms: A Quest for Absolute Definitions

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2003, Bull. EATCS.

Who needs category theory? pdf

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2018, Bull. EATCS.

On polynomial time computation over unordered structures

Saharon Shelah, Andreas Blass, Yuri Gurevich, 2001, Journal of Symbolic Logic.

Logic in Computer Ccience Column, guest authors

Andreas Blass, 1988, Bull. EATCS.

Meeting of the Association for Symbolic Logic: Chicago, 1985

Andreas Blass, Peter G. Hinman, Louise Hay, 1986, J. Symb. Log..

Equivalence relations, invariants, and normal forms

Andreas Blass, Yuri Gurevich, 1983, Logic and Machines.

Program termination and well partial orderings

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2008, TOCL.

Groupwise density and related cardinals

Andreas Blass, A. Blass, 1990, Arch. Math. Log..

There may be simple Paleph1 and Paleph2-points and the Rudin-Keisler ordering may be downward directed

Saharon Shelah, Andreas Blass, 1987, Ann. Pure Appl. Log..

On the Unique Satisfiability Problem

Andreas Blass, Yuri Gurevich, Y. Gurevich, 1982, Inf. Control..

Interactive Small-Step Algorithms I: Axiomatization pdf

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, 2007, Log. Methods Comput. Sci..

Symbioses between mathematical logic and computer science

Andreas Blass, A. Blass, 2016, Ann. Pure Appl. Log..

Abstract State Machines and Computationally Complete Query Languages

Jan Van den Bussche, Andreas Blass, Yuri Gurevich, 2000, Abstract State Machines.

Complete Topoi Representing Models of Set Theory

Andreas Blass, Andre Scedrov, 1992, Ann. Pure Appl. Log..

On Quantum Computation, Anyons, and Categories

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2015, Martin Davis on Computability, Computational Logic, and Mathematical Foundations.

Introduction to Secret-Sharing

Andreas Blass, 2016, Dependence Logic.

Coherence for braided distributivity pdf

Andreas Blass, Yuri Gurevich, 2020, Theor. Comput. Sci..

Background of Computation

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2007, Bull. EATCS.

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

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2003, Journal of Symbolic Logic.

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

Andreas Blass, Yuri Gurevich, Dexter Kozen, 1986, Inf. Control..

Abstract state machines capture parallel algorithms: Correction and extension

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2006, TOCL.

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

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2017, QPL.

Ordinary interactive small-step algorithms, II

Andreas Blass, Yuri Gurevich, 2007, TOCL.

On Matijasevitch's Nontraditional Approach to Search Problems

Andreas Blass, Yuri Gurevich, 1989, Inf. Process. Lett..

Negative probability

Andreas Blass, A. Blass, 1945, Mathematical Proceedings of the Cambridge Philosophical Society.

The Intersection of Nonstandard Models of Arithmetic

Andreas Blass, 1972, J. Symb. Log..

Persistent Queries pdf

Andreas Blass, Yuri Gurevich, 2008, ArXiv.

Play to Test

Margus Veanes, Andreas Blass, Yuri Gurevich, 2005, FATES.

A Quick Update on the Open Problems in Blass-Gurevich-Shelah's article \On Polynomial Time Computations Over Unordered Structures"

Andreas Blass, Yuri Gurevich, 2017 .

Hilbertian Deductive Systems, Infon Logic, and Datalog

Andreas Blass, Yuri Gurevich, 2010, Bull. EATCS.

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

Nikolaj Bjørner, Andreas Blass, Yuri Gurevich, 2010, J. Comput. Syst. Sci..

There are not Exactly Five Objects

Andreas Blass, 1984, J. Symb. Log..

Is Game Semantics Necessary?

Andreas Blass, 1993, CSL.

One Useful Logic That Defines Its Own Truth

Andreas Blass, Yuri Gurevich, 2008, MFCS.

Partitions and Permutation Groups

Andreas Blass, 2009, AMS-ASL Joint Special Session.

Needed reals and recursion in generic reals

Andreas Blass, A. Blass, 2001, Ann. Pure Appl. Log..

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

Andreas Blass, Yuri Gurevich, Efim Hudis, 2010, Bull. EATCS.

Zero-One Laws: Thesauri and Parametric Conditions

Andreas Blass, Yuri Gurevich, 2007, Bull. EATCS.

A Game Semantics for Linear Logic

Andreas Blass, A. Blass, 1992, Ann. Pure Appl. Log..

The model of set theory generated by countably many generic reals

Andreas Blass, A. Blass, 1981, Journal of Symbolic Logic.

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

Andreas Blass, Yuri Gurevich, 2008, Bull. EATCS.

On the Rectilinear Steiner Problem

Andreas Blass, Yuri Gurevich, 2017, Bull. EATCS.

An Invitation to Quantum Computing

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2018, Bull. EATCS.

Witness algebra and anyon braiding

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2018, Mathematical Structures in Computer Science.

Sperner spaces and first-order logic

Victor Pambuccian, Andreas Blass, 2003, Math. Log. Q..

Inadequacy of computable loop invariants

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2001, TOCL.

Bijective proofs of two broken circuit theorems

Andreas Blass, Bruce E. Sagan, B. Sagan, 1986, J. Graph Theory.

Existential Fixed-Point Logic, Universal Quantifiers, and Topoi

Andreas Blass, A. Blass, 2010, Fields of Logic and Computation.

A New Zero-One Law and Strong Extension Axioms

Andreas Blass, Yuri Gurevich, 2000, Bull. EATCS.

Modular difference logic is hard pdf

Nikolaj Bjørner, Andreas Blass, Yuri Gurevich, 2008, ArXiv.

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

Andreas Blass, A. Blass, 1986, Notre Dame J. Formal Log..

An Induction Principle and Pigeonhole Principles for K-Finite Sets

Andreas Blass, 1995, J. Symb. Log..

The Underlying Logic of Hoare Logic

Andreas Blass, Yuri Gurevich, 2000, Bull. EATCS.

Divisibility of Dedekind finite Sets

David Blair, Andreas Blass, Paul Howard, 2005, J. Math. Log..

Random Orders and Gambler's Ruin

Andreas Blass, Gábor Braun, 2005, Electron. J. Comb..

Theories without countable models

Andreas Blass, A. Blass, 1972, Journal of Symbolic Logic.

The Logic of Choice

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2000, Journal of Symbolic Logic.

Algorithms vs. Machines

Andreas Blass, Yuri Gurevich, 2002, Bull. EATCS.

Makkai Michael and Paré Robert. Accessible categories: the foundations of categorical model theory . Contemporary mathematics, vol. 104. American Mathematical Society, Providence 1989, viii + 176 pp.

Andreas Blass, 1993 .

Fields of Logic and Computation II

Bernd Finkbeiner, Nachum Dershowitz, Andreas Blass, 2015, Lecture Notes in Computer Science.

Choiceless Polynominal Time Computation and the Zero-One Law

Andreas Blass, Yuri Gurevich, 2000, CSL.

A Variation on the Zero-One Law

Vladik Kreinovich, Andreas Blass, Yuri Gurevich, 1998, Inf. Process. Lett..

Abstract state machines capture parallel algorithms

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2003, TOCL.

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

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, 2007, Log. Methods Comput. Sci..

On The Confinality of Ultrapowers

Andreas Blass, Heike Mildenberger, 1999, J. Symb. Log..

General Interactive Small Step Algorithms

Andreas Blass, Yuri Gurevich, Dean Rosenzweig, 2005 .

Topoi and Computation

Andreas Blass, 1993, Current Trends in Theoretical Computer Science.

Graphs with unique maximal clumpings

Andreas Blass, A. Blass, 1978, J. Graph Theory.

Adapting Logics

Andreas Blass, 2006, 21st Annual IEEE Symposium on Logic in Computer Science (LICS'06).

The Next Best Thing to a P-Point

Andreas Blass, Natasha Dobrinen, Dilip Raghavan, 2015, J. Symb. Log..

Functional Thesauri, Classifying Topoi, Unification, and Flatness

Andreas Blass, A. Blass, 2020, Fields of Logic and Computation III.

Background, Reserve, and Gandy Machines

Andreas Blass, Yuri Gurevich, 2000, CSL.

Randomizing Reductions of Search Problems

Andreas Blass, Yuri Gurevich, 1991, FSTTCS.

On the Reduction Theory for Average Case Complexity

Andreas Blass, Yuri Gurevich, 1990, CSL.

Circuits: An abstract viewpoint pdf

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2020, Bull. EATCS.

Ramsey's Theorem in the Hierarchy of Choice Principles

Andreas Blass, 1977, J. Symb. Log..

Some Semantical Aspects of Linear Logic

Andreas Blass, A. Blass, 1997, Log. J. IGPL.

Exact Exploration and Hanging Algorithms

Nachum Dershowitz, Andreas Blass, Yuri Gurevich, 2010, CSL.

Fields of Logic and Computation

Bernd Finkbeiner, Nachum Dershowitz, Andreas Blass, 2011 .

Amalgamation of Nonstandard Models of Arithmetic

Andreas Blass, 1977, J. Symb. Log..

Properties of almost all graphs and complexes

Frank Harary, Andreas Blass, F. Harary, 1979, J. Graph Theory.

Small Decidable Sheaves

Andreas Blass, Andre Scedrov, 1986, J. Symb. Log..

Conservative extensions of models of arithmetic

Andreas Blass, 1980, Arch. Math. Log..

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

Andreas Blass, 2015, Fields of Logic and Computation II.

Acknowledgement of Priority

Andreas Blass, 1985, J. Symb. Log..

Evolving Algebras and Linear Time Hierarchy

Andreas Blass, Yuri Gurevich, Y. Gurevich, 1994, IFIP Congress.

Explicit Graphs with Extension Properties

Andreas Blass, Benjamin Rossman, 2005, Bull. EATCS.

Randomizing Reductions of Search Problems

Andreas Blass, Yuri Gurevich, 1993, SIAM J. Comput..

Existential Fixed-Point Logic

Andreas Blass, Yuri Gurevich, Y. Gurevich, 1987, Computation Theory and Logic.

On Certain Types and Models for Arithmetic

Andreas Blass, 1974, J. Symb. Log..

Near Coherence of Filters III: A Simplified Consistency Proof

Saharon Shelah, Andreas Blass, S. Shelah, 1989, Notre Dame J. Formal Log..

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

Saharon Shelah, Andreas Blass, Yuri Gurevich, 2001, Ann. Pure Appl. Log..

Choiceless Polynomial Time

Saharon Shelah, Andreas Blass, Yuri Gurevich, 1997, Ann. Pure Appl. Log..

Homotopy and Homology of Finite Lattices

Andreas Blass, A. Blass, 2003, Electron. J. Comb..

Why Sets? (Column: Logic in Computer Science)

Andreas Blass, Yuri Gurevich, 2004, Bull. EATCS.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics): Preface

Wolfgang Reisig, Nachum Dershowitz, Andreas Blass, 2010 .

Equivalence Relations, Invariants, and Normal Forms

Andreas Blass, Yuri Gurevich, Y. Gurevich, 1983, SIAM J. Comput..

Cores of pi11 Sets of Reals

Douglas A. Cenzer, Andreas Blass, 1974, J. Symb. Log..

Fields of Logic and Computation III: Essays Dedicated to Yuri Gurevich on the Occasion of His 80th Birthday

Wolfgang Reisig, Nachum Dershowitz, Andreas Blass, 2020, Fields of Logic and Computation III.

On exponentiation of G-sets

Andreas Blass, 1994, Discret. Math..

NP-Completeness of Deciding Binary Genetic Encodability

Andreas Blass, Boris Mitavskiy, 2005, FOGA.

Circuit pedantry pdf

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2019, Bull. EATCS.

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

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2018, Bull. EATCS.

Theory and Application of Abstract State Machines (Dagstuhl Seminar 02101)

Egon Börger, Andreas Blass, Yuri Gurevich, 2021 .

Simple circuit simulations of classical and quantum Turing machines pdf

Andreas Blass, Yuri Gurevich, 2021, ArXiv.

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

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2021, Theor. Comput. Sci..

Wigner's quasidistribution and Dirac's kets pdf

Andreas Blass, Yuri Gurevich, Alexander Volberg, 2022, ArXiv.

Two closed categories of filters

Andreas Blass, 1977 .

On strong P-points

Andreas Blass, Jonathan Verner, Michael Hrušák, 2013 .

Characteristic and Ehrhart Polynomials

Andreas Blass, Bruce E. Sagan, 1998 .

Reductions Between Cardinal Characteristics of the Continuum

Andreas Blass, 1994 .

Simple Cardinal Characteristics of the Continuum

Andreas Blass, 1994 .

Injectivity, projectivity, and the axiom of choice

Andreas Blass, A. Blass, 1979 .

Ultrafilters across Mathematics

Andreas Blass, Vitaly Bergelson, Mauro Di Nasso, 2010 .

Logical analysis of some theorems of combinatorics and topological dynamics

Stephen G. Simpson, Andreas Blass, Je Ry L. Hirst, 1987 .

Ancilla-approximable quantum state transformations

Andreas Blass, Yuri Gurevich, Y. Gurevich, 2014, 1403.7815.

Mobius functions of lattices

Andreas Blass, Bruce E. Sagan, 1997 .

Exact functors and measurable cardinals.

Andreas Blass, A. Blass, 1976 .

Determinateness and continuity

Andreas Blass, 1973 .

An axiomatic approach to rank in model theory

John T. Baldwin, Andreas Blass, 1974 .

An introduction to DKAL

Andreas Blass, Yuri Gurevich, Guido de Caso, 2012 .

Combinatorial Cardinal Characteristics of the Continuum

Andreas Blass, A. Blass, 2010 .

SOME QUESTIONS ARISING FROM HINDMAN'S THEOREM

Andreas Blass, 2005 .

Ultrafilters with small generating sets

Saharon Shelah, Andreas Blass, 1989 .

Freyd's models for the independence of the axiom of choice

Andreas Blass, Andrej Ščedrov, 1989 .

Review: Martin Davis, Applied nonstandard analysis, and K. D. Stroyan and W. A. J. Luxemburg, Introduction to the theory of infinitesimals, and H. Jerome Keisler, Foundations of infinitesimal calculus

Andreas Blass, 1978 .

Classifying topoi and finite forcing

Andreas Blass, Andrej Ščedrov, 1983 .

THE DESCRIPTIVE SET THEORY OF POLISH GROUP ACTIONS (LMS Lecture Note Series 232) By Howard Becker and Alexander S. Kechris: 136 pp., £21.95 (LMS Members' price £16.45), ISBN 0 521 57605 9 (Cambridge University Press, 1996).

Andreas Blass, A. Blass, 1998 .

Equivalence Relations, Invariants, and Normal Forms, II

Andreas Blass, Yuri Gurevich, 2017 .

Degrees of indeterminacy of games

Andreas Blass, A. Blass, 1972 .

Cardinal Characteristics and the Product of Countably Many Infinite Cyclic Groups

Andreas Blass, 1992 .

Existence of bases implies the axiom of choice

Andreas Blass, A. Blass, 1984 .

Questions and answers: a category arising in linear logic complexity theory, and set theory

Andreas Blass, A. Blass, 1993, math/9309208.

A partition theorem for perfect sets

Andreas Blass, A. Blass, 1981 .

Ultrafilters: Where topological dynamics = algebra = combinatorics

Andreas Blass, 1993 .

The Rudin-Keisler ordering of $P$-points

Andreas Blass, 1973 .

A note on extensions of asymptotic density

Andreas Blass, Grzegorz Plebanek, Ryszard Frankiewicz, 2001 .

A characterization and sum decomposition for operator ideals

Andreas Blass, Gary Weiss, A. Blass, 1978 .

Words, free algebras, and coequalizers

Andreas Blass, 1983 .

Equivalence of two strong forms of determinacy

Andreas Blass, 1975 .