


Остановите войну!
for scientists:
Andreas Blass
Person information

Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
- [j93]Yuri Gurevich
, Andreas Blass
:
Quantum circuits with classical channels and the principle of deferred measurements. Theor. Comput. Sci. 920: 21-32 (2022) - [i16]Andreas Blass, Yuri Gurevich, Alexander Volberg:
Wigner's quasidistribution and Dirac's kets. CoRR abs/2201.05911 (2022) - 2021
- [i15]Yuri Gurevich, Andreas Blass:
Quantum circuits with classical channels and the principle of deferred measurements. CoRR abs/2107.08324 (2021) - [i14]Yuri Gurevich, Andreas Blass:
Simple circuit simulations of classical and quantum Turing machines. CoRR abs/2111.10830 (2021) - 2020
- [j92]Andreas Blass, Yuri Gurevich:
Circuits: An abstract viewpoint. Bull. EATCS 131 (2020) - [j91]Andreas Blass, Yuri Gurevich
:
Witness algebra and anyon braiding. Math. Struct. Comput. Sci. 30(3): 234-270 (2020) - [j90]Andreas Blass, Yuri Gurevich:
Braided distributivity. Theor. Comput. Sci. 807: 73-94 (2020) - [c23]Andreas Blass:
Functional Thesauri, Classifying Topoi, Unification, and Flatness. Fields of Logic and Computation III 2020: 46-56 - [e3]Andreas Blass, Patrick Cégielski, Nachum Dershowitz, Manfred Droste, Bernd Finkbeiner:
Fields of Logic and Computation III - Essays Dedicated to Yuri Gurevich on the Occasion of His 80th Birthday. Lecture Notes in Computer Science 12180, Springer 2020, ISBN 978-3-030-48005-9 [contents] - [i13]Andreas Blass, Yuri Gurevich:
Circuits: An abstract viewpoint. CoRR abs/2006.09488 (2020) - [i12]Andreas Blass, Yuri Gurevich:
Negative probabilities: What they are and what they are for. CoRR abs/2009.10552 (2020)
2010 – 2019
- 2019
- [j89]Andreas Blass, Yuri Gurevich:
Circuit pedantry. Bull. EATCS 129 (2019) - [i11]Andreas Blass, Yuri Gurevich:
Circuit pedantry. CoRR abs/1910.06145 (2019) - 2018
- [j88]Andreas Blass, Yuri Gurevich:
Who needs category theory? Bull. EATCS 124 (2018) - [j87]Andreas Blass, Yuri Gurevich:
Negative probabilities, II What they are and what they are for. Bull. EATCS 125 (2018) - [j86]Andreas Blass, Yuri Gurevich:
An Invitation to Quantum Computing. Bull. EATCS 126 (2018) - [i10]Andreas Blass, Yuri Gurevich:
Witness Algebra and Anyon Braiding. CoRR abs/1807.10414 (2018) - [i9]Andreas Blass, Yuri Gurevich:
Who needs category theory? CoRR abs/1807.11399 (2018) - [i8]Andreas Blass, Yuri Gurevich:
Coherence for braided distributivity. CoRR abs/1807.11403 (2018) - 2017
- [j85]Andreas Blass, Yuri Gurevich:
On the Rectilinear Steiner Problem. Bull. EATCS 121 (2017) - [c22]Andreas Blass, Yuri Gurevich:
Common Denominator for Value and Expectation No-go Theorems: Extended Abstract. QPL 2017: 98-103 - 2016
- [j84]Andreas Blass:
Symbioses between mathematical logic and computer science. Ann. Pure Appl. Log. 167(10): 868-878 (2016) - [p5]Andreas Blass:
Introduction to Secret-Sharing. Dependence Logic 2016: 261-276 - [p4]Andreas Blass, Yuri Gurevich:
On Quantum Computation, Anyons, and Categories. Martin Davis on Computability, Computational Logic, and Mathematical Foundations 2016: 209-241 - 2015
- [j83]Andreas Blass:
Negative Probability. Bull. EATCS 115 (2015) - [j82]Andreas Blass, Natasha Dobrinen, Dilip Raghavan:
The Next Best Thing to a P-Point. J. Symb. Log. 80(3): 866-900 (2015) - [c21]Andreas Blass:
Existential Fixed-Point Logic as a Fragment of Second-Order Logic. Fields of Logic and Computation II 2015: 52-68 - [e2]Lev D. Beklemishev
, Andreas Blass, Nachum Dershowitz, Bernd Finkbeiner, Wolfram Schulte:
Fields of Logic and Computation II - Essays Dedicated to Yuri Gurevich on the Occasion of His 75th Birthday. Lecture Notes in Computer Science 9300, Springer 2015, ISBN 978-3-319-23533-2 [contents] - 2013
- [j81]Andreas Blass, Yuri Gurevich:
Abstract Hilbertian deductive systems, infon logic, and Datalog. Inf. Comput. 231: 21-37 (2013) - 2011
- [j80]Andreas Blass, Yuri Gurevich:
Persistent queries in the behavioral theory of algorithms. ACM Trans. Comput. Log. 12(2): 16:1-16:43 (2011) - [p3]Andreas Blass, Yuri Gurevich:
Zero-One Laws: Thesauri and Parametric Conditions. Proof, Computation and Agency 2011: 99-114 - 2010
- [j79]Andreas Blass, Yuri Gurevich, Efim Hudis:
The Tower-of-Babel Problem, and Security Assesment Sharing. Bull. EATCS 101: 161-182 (2010) - [j78]Andreas Blass, Yuri Gurevich:
Hilbertian Deductive Systems, Infon Logic, and Datalog. Bull. EATCS 102: 122-150 (2010) - [j77]Nikolaj S. 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) - [c20]Andreas Blass, Nachum Dershowitz, Wolfgang Reisig:
Yuri, Logic, and Computer Science. Fields of Logic and Computation 2010: 1-48 - [c19]Andreas Blass, Yuri Gurevich, Michal Moskal, Itay Neeman:
Evidential Authorization. The Future of Software Engineering 2010: 73-99 - [c18]Andreas Blass:
Existential Fixed-Point Logic, Universal Quantifiers, and Topoi. Fields of Logic and Computation 2010: 108-134 - [c17]Andreas Blass, Nachum Dershowitz, Yuri Gurevich:
Exact Exploration and Hanging Algorithms. CSL 2010: 140-154 - [e1]Andreas Blass, Nachum Dershowitz, Wolfgang Reisig:
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 [contents]
2000 – 2009
- 2009
- [j76]Andreas Blass, Su Gao, Yi Zhang:
Preface. Ann. Pure Appl. Log. 158(3): 155 (2009) - [j75]Andreas Blass, Nachum Dershowitz, Yuri Gurevich:
When are two algorithms the same? Bull. Symb. Log. 15(2): 145-168 (2009) - [c16]Andreas Blass:
Partitions and Permutation Groups. AMS-ASL Joint Special Session 2009: 453-466 - 2008
- [j74]Andreas Blass, Yuri Gurevich:
Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bull. EATCS 95: 164-182 (2008) - [j73]Andreas Blass, Yuri Gurevich:
Program termination and well partial orderings. ACM Trans. Comput. Log. 9(3): 18:1-18:26 (2008) - [j72]Andreas Blass, Yuri Gurevich:
Abstract state machines capture parallel algorithms: Correction and extension. ACM Trans. Comput. Log. 9(3): 19:1-19:32 (2008) - [c15]Andreas Blass, Yuri Gurevich:
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 S. Bjørner, Andreas Blass, Yuri Gurevich, Madan Musuvathi:
Modular difference logic is hard. CoRR abs/0811.0987 (2008) - 2007
- [j71]Andreas Blass, Yuri Gurevich:
Zero-One Laws: Thesauri and Parametric Conditions. Bull. EATCS 91: 125-144 (2007) - [j70]Andreas Blass, Yuri Gurevich:
Background of Computation. Bull. EATCS 92: 82-114 (2007) - [j69]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms I: Axiomatization. Log. Methods Comput. Sci. 3(4) (2007) - [j68]Andreas Blass, Yuri Gurevich, Dean Rosenzweig, Benjamin Rossman:
Interactive Small-Step Algorithms II: Abstract State Machines and the Characterization Theorem. Log. Methods Comput. Sci. 3(4) (2007) - [j67]Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, II. ACM Trans. Comput. Log. 8(3): 15 (2007) - [j66]Andreas Blass, Yuri Gurevich:
Ordinary interactive small-step algorithms, III. ACM Trans. Comput. Log. 8(3): 16 (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
- [j65]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
- [j64]Andreas Blass, Gábor Braun:
Random Orders and Gambler's Ruin. Electron. J. Comb. 12 (2005) - [j63]Andreas Blass, Benjamin Rossman:
Explicit Graphs with Extension Properties. Bull. EATCS 86: 166-175 (2005) - [j62]David Blair, Andreas Blass, Paul Howard:
Divisibility of Dedekind finite Sets. J. Math. Log. 5(1) (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
- [j61]Andreas Blass, Yuri Gurevich:
Why Sets? (Column: Logic in Computer Science). Bull. EATCS 84: 139-156 (2004) - 2003
- [j60]Andreas Blass:
Homotopy and Homology of Finite Lattices. Electron. J. Comb. 10 (2003) - [j59]Andreas Blass, Yuri Gurevich:
Algorithms: A Quest for Absolute Definitions. Bull. EATCS 81: 195-225 (2003) - [j58]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) - [j57]Andreas Blass, Victor Pambuccian
:
Sperner spaces and first-order logic. Math. Log. Q. 49(2): 111-114 (2003) - [j56]Andreas Blass, Yuri Gurevich:
Abstract state machines capture parallel algorithms. ACM Trans. Comput. Log. 4(4): 578-651 (2003) - 2002
- [j55]Andreas Blass, Yuri Gurevich:
Algorithms vs. Machines. Bull. EATCS 77: 96-119 (2002) - [j54]Andreas Blass, Yuri Gurevich:
Pairwise Testing. Bull. EATCS 78: 100-132 (2002) - [j53]Andreas Blass, Yuri Gurevich, Jan Van den Bussche:
Abstract State Machines and Computationally Complete Query Languages. Inf. Comput. 174(1): 20-36 (2002) - [j52]Andreas Blass, Yuri Gurevich, Saharon Shelah
:
On Polynomial Time Computation over Unordered Structures. J. Symb. Log. 67(3): 1093-1125 (2002) - 2001
- [j51]Andreas Blass:
Needed reals and recursion in generic reals. Ann. Pure Appl. Log. 109(1-2): 77-88 (2001) - [j50]Andreas Blass, Yuri Gurevich, Saharon Shelah
:
Addendum to "Choiceless Polynomial Time": Ann. Pure Appl. Logic 100 (1999) 141-187. Ann. Pure Appl. Log. 112(1): 117 (2001) - [j49]Andreas Blass, Yuri Gurevich:
Inadequacy of computable loop invariants. ACM Trans. Comput. Log. 2(1): 1-11 (2001) - [p2]Andreas Blass, Yuri Gurevich:
The Underlying Logic of Hoare Logic. Current Trends in Theoretical Computer Science 2001: 409-436 - 2000
- [j48]Andreas Blass, Yuri Gurevich:
The Underlying Logic of Hoare Logic. Bull. EATCS 70: 82-111 (2000) - [j47]Andreas Blass, Yuri Gurevich:
A New Zero-One Law and Strong Extension Axioms. Bull. EATCS 72: 103-122 (2000) - [j46]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
1990 – 1999
- 1999
- [j45]Andreas Blass, Yuri Gurevich, Saharon Shelah
:
Choiceless Polynomial Time. Ann. Pure Appl. Log. 100(1-3): 141-187 (1999) - [j44]Andreas Blass, Heike Mildenberger:
On The Confinality of Ultrapowers. J. Symb. Log. 64(2): 727-736 (1999) - 1998
- [j43]Andreas Blass, Yuri Gurevich, Vladik Kreinovich, Luc Longpré:
A Variation on the Zero-One Law. Inf. Process. Lett. 67(1): 29-30 (1998) - 1997
- [j42]Andreas Blass:
Some Semantical Aspects of Linear Logic. Log. J. IGPL 5(4): 487-503 (1997) - [j41]Andreas Blass, Yuri Gurevich:
The Linear Time Hierarchy Theorems for Abstract State Machines and RAMs. J. Univers. Comput. Sci. 3(4): 247-278 (1997) - 1995
- [j40]Andreas Blass:
An Induction Principle and Pigeonhole Principles for K-Finite Sets. J. Symb. Log. 60(4): 1186-1193 (1995) - [j39]Andreas Blass, Yuri Gurevich:
Matrix Transformation Is Complete for the Average Case. SIAM J. Comput. 24(1): 3-29 (1995) - 1994
- [j38]Andreas Blass:
On exponentiation of G-sets. Discret. Math. 135(1-3): 69-79 (1994) - [c6]Andreas Blass, Yuri Gurevich:
Evolving Algebras and Linear Time Hierarchy. IFIP Congress (1) 1994: 383-390 - 1993
- [j37]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 - [p1]Andreas Blass:
Topoi and Computation. Current Trends in Theoretical Computer Science 1993: 310-317 - 1992
- [j36]Andreas Blass:
A Game Semantics for Linear Logic. Ann. Pure Appl. Log. 56(1-3): 183-220 (1992) - [j35]Andreas Blass, Andre Scedrov
:
Complete Topoi Representing Models of Set Theory. Ann. Pure Appl. Log. 57(1): 1-26 (1992) - [j34]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
- [j33]Andreas Blass:
Groupwise density and related cardinals. Arch. Math. Log. 30(1): 1-11 (1990) - [j32]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
1980 – 1989
- 1989
- [j31]Andreas Blass, Yuri Gurevich:
On Matijasevitch's Nontraditional Approach to Search Problems. Inf. Process. Lett. 32(1): 41-45 (1989) - [j30]Andreas Blass, Claude Laflamme:
Consistency Results About Filters and the Number of Inequivalent Growth Types. J. Symb. Log. 54(1): 50-56 (1989) - [j29]Andreas Blass, Saharon Shelah
:
Near Coherence of Filters III: A Simplified Consistency Proof. Notre Dame J. Formal Log. 30(4): 530-538 (1989) - 1988
- [j28]Andreas Blass:
Selective ultrafilters and homogeneity. Ann. Pure Appl. Log. 38(3): 215-255 (1988) - [j27]Andreas Blass:
Logic in Computer Ccience Column, guest authors. Bull. EATCS 36: 57-65 (1988) - 1987
- [j26]Andreas Blass, Saharon Shelah
:
There may be simple Paleph1 and Paleph2-points and the Rudin-Keisler ordering may be downward directed. Ann. Pure Appl. Log. 33: 213-243 (1987) - [c2]Andreas Blass, Yuri Gurevich:
Existential Fixed-Point Logic. Computation Theory and Logic 1987: 20-36 - 1986
- [j25]Andreas Blass, Yuri Gurevich:
Henkin quantifiers and complete problems. Ann. Pure Appl. Log. 32: 1-16 (1986) - [j24]Andreas Blass, Bruce E. Sagan:
Bijective proofs of two broken circuit theorems. J. Graph Theory 10(1): 15-21 (1986) - [j23]Andreas Blass, Louise Hay, Peter G. Hinman:
Meeting of the Association for Symbolic Logic: Chicago, 1985. J. Symb. Log. 51(2): 507-510 (1986) - [j22]Andreas Blass, Andre Scedrov:
Small Decidable Sheaves. J. Symb. Log. 51(3): 726-731 (1986) - [j21]Andreas Blass:
Near coherence of filters. I. Cofinal equivalence of models of arithmetic. Notre Dame J. Formal Log. 27(4): 579-591 (1986) - 1985
- [j20]Andreas Blass, Yuri Gurevich, Dexter Kozen:
A Zero-One Law for Logic with a Fixed-Point Operator. Inf. Control. 67(1-3): 70-90 (1985) - [j19]Andreas Blass:
Acknowledgement of Priority. J. Symb. Log. 50(3): 781 (1985) - 1984
- [j18]Andreas Blass:
There are not Exactly Five Objects. J. Symb. Log. 49(2): 467-469 (1984) - [j17]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
- [j16]Andreas Blass, Yuri Gurevich:
On the Unique Satisfiability Problem. Inf. Control. 55(1-3): 80-88 (1982) - 1981
- [j15]Andreas Blass, Geoffrey Exoo, Frank Harary:
Paley graphs satisfy all first-order adjacency axioms. J. Graph Theory 5(4): 435-439 (1981) - [j14]Andreas Blass:
Some Initial Segments of the Rudin-Keisler Ordering. J. Symb. Log. 46(1): 147-157 (1981) - [j13]Andreas Blass:
The Model of Set Theory Generated by Countably Many Generic Reals. J. Symb. Log. 46(4): 732-752 (1981) - 1980
- [j12]Andreas Blass:
Conservative extensions of models of arithmetic. Arch. Math. Log. 20(3-4): 85-94 (1980) - [j11]Andreas Blass, Frank Harary, Zevi Miller:
Which trees are link graphs? J. Comb. Theory, Ser. B 29(3): 277-292 (1980)
1970 – 1979
- 1979
- [j10]Andreas Blass, Frank Harary:
Properties of almost all graphs and complexes. J. Graph Theory 3(3): 225-240 (1979) - 1978
- [j9]Andreas Blass:
Graphs with unique maximal clumpings. J. Graph Theory 2(1): 19-24 (1978) - 1977
- [j8]Andreas Blass:
Amalgamation of Nonstandard Models of Arithmetic. J. Symb. Log. 42(3): 372-386 (1977) - [j7]Andreas Blass:
Ramsey's Theorem in the Hierarchy of Choice Principles. J. Symb. Log. 42(3): 387-390 (1977) - 1974
- [j6]Andreas Blass:
On Certain Types and Models for Arithmetic. J. Symb. Log. 39(1): 151-162 (1974) - [j5]