Technical reports

Technion - Israel Institute of Technology, Department of Computer Science

• [197] O.Grumberg, N. Francez, J.A. Makowsky and W.P. de Roever. A proof rule for fair termination of guarded commands, 22 pp., February 1981.
• [232] B. Mahr and J.A. Makowsky, Characterizing speciication languages which admit initial semantics, 15 pp., February 1982.
• [234] J.A. Makowsky and M.L. Tiomkin, An array assignment for propositional dynamic logic, 19 pp., March 1982.
• [243] A. Itai and J.A. Makowsky, On the complexity of Herbrand's theorem, 12 pp., May 1982.
• [246] J.A. Makowsky, Compactness and unions of chains, 11 pp., June 1982.
• [252] B. Mahr and J.A. Makowsky, An axiomatic approach to semantics of specification languages, 15 pp., November 1982.
• [254] J.A. Makowsky and S. Shelah, Positivie results in abstract model theory: A theory of compact logics, 56 pp., December 1982.
• [270] J.A. Makowsky, Model theoretic issues in theoretical computer science, part I: Relational data bases and abstract data types, 45 pp., April 1983.
• [286] J.A. Makowsky, Abstrac embedding relations, 50 pp., June 1983.
• [287] J.A. Makowsky, Compactness, embeddings and definability, 80 pp., July 1983 (revised version November 1983).
• [301] A. Itai and J.A. Makowsky, Unification as a complexity measure for logic programming, 15 pp., November 1983.
• [305] M.L. Tiomkin and J.A. Makowsky, Probabilistic propositional dynamic logic, 41 pp., November 1983.
• [320] E. Dahlhaus, A. Israeli and J.A. Makowsky, On the existence of polynomial time algorithms for interpolation problems in propositional logic, 21 pp., June 1984.
• [326] J.A. Makowsky and M. Vardi, On the expressive power of data dependencies, 14 pp., Junly 1984.
• [329] J.A. Makowsky, Why Horn formulas matter in computer science : initial structures and generic examples, 23 pp., July 1984.
• [392] J.A. Makowsky, V.M. Markowitz and N. Rotics, Entity-relationship consistency for relational schemas, 24 pp., December 1985.
• [394] M.L. Tiomkin and J.A.Makowsky, Decidability questions for finite probabilistic propositional dynamic logic, 21 pp., January 1986.
• [395] J.A. Makowsky and I. Sain, On the equivalence of weak second order and nonstandard time semantics for various program verification systems, 11 pp., January 1986.
• [412] V.M. Markowitz an J.A. Makowsky, Unifying entity-relationship and universal relation approaches to user interfaces, 24 pp., May 1986.
• [435] A. Ban and J.A. Makowsky, MUSICIAN - A music processing and synthesis system, 9 pp., September 1986.
• [442] V.M.Markowitz and J.A. Makowsky, Incremental restructuring of relational schemes, 24 pp., December 1986.
• [448] V.M.Markowitz and J.A. Makowsky, Incremental reorganization of relational databases, 23 pp., February 1987.
• [454] E. Dahlhaus and J.A. Makowsky, Computable directory queries (revised version), 24 pp., June 1987.
• [457] J.A. Makowsky and I. Sain, Weak second order characterizations of various program verification systems, 29 pp., June 1987.
• [687] R.A. Hasson and J.A. Makowsky, Update Languages vs. Query Languages, 14 pp., September 1991.
• [711] J.A. Makowsky: Model Theory and Computer Science: An Appetizer. 52 pp., April 1992
• [712] A. Calo and J.A. Makowsky: The Ehrenfeucht-Fraisse Games for Transitive Closure, 14 p., January 1992.
• [723] J.A. Makowsky: Computable Quantifiers and Logics over Finite Structures, 19 p., April 1992 (revised as TR 768).
• [739] J. Makowsky and A. Sharell. On Average Case Complexity of SAT for Symmetric Distributions.
• [746] A. Sharell and J. Makowsky: Probabilistic Lower Bounds for Average Case Complexity. 48 pp., July 1992
• [758] J.A. Makowsky and Y.B.Pnueli: Computable Quantifiers and Logics Capturing Classes, 21 p., November 1992
• [768] J. A. Makowsky and Y.B. Pnueli: Computable Quantifiers and Logics over Finite Structures, 39 pp., February 1992
• [784] J. A. Makowsky and U. Rotics: Optimal Spanners in Partial $k$-Trees. 10 pp., October 1993
• [785] J.A. Makowsky and Y.B. Pnueli: Oracles and Quantifiers. 17 pp., October 1993
• [818] J.A. Makowsky and Y.B. Pnueli: Arity vs Alternation in Second Order Logic, 14 pp., May 1994
• [819] J. Makowsky and A. Sharell. On Average Case Complexity of SAT for Symmetric Distributions. (Revised version of TR739) xx pp., May 1994
• [xxx] J.A. Makowsky and Y.B. Pnueli: Oracles and Quantifiers. (Revised version of TR785)

Technion - Israel Institute of Technology, Intelligent Systems Laboratory

• [9002] V.M. Markovitz and J.A. Makowsky: Identifying Extended Entity--Relationship Object Structures in Relational Schemas, 31 p., May 1990.
• [9005] J.--C. Gregoire, J.A. Makowsky and S. Sagiv: The Expressive Power of Side Effects in PROLOG, 13 p., June 1990.
• [9006] J. Ukelson and J.A. Makowsky: Formal Interactive Mwenu Design, 13 p., June 1990.
• [9102] J.-Ch. Gregoire, J.A. Makowsky, S.E. Levin: Programming Reactive Systems with Statecharts, 24 p., April 1991.
• [9111] Y.Bargury and J. Makowsky: The Expressive Power of Transitive Closure and 2--way Multihead Automata, 13 p., October 1991.
• [9218] M.Z. Rupp, J.A. Makowsky, and I. Pomeranz: Adequate Test Sets for Loop Testing, 27 p., November 1992.
• [9317] A.M. Cohen and J.A. Makowsky: Two Approaches to Nonmonotonic Equality. 18 pp., April 1993

Eidgenoessische Technische Hochschule Zuerich, Institut fuer Informatik

• [65] E. Dahlhaus and J.A. Makowsky, Computable directory queries and The choice of programming primitives for SETL-like programming languages, 41 pp., September 1985.

Eidgenoessische Technische Hochschule Zuerich, Forschungsinstitut fuer Mathematik

IBM Research Reports

• [RC 8757] A. K. Chandra, H. R. Lewis and J.A. Makowsky, Embedded Implicational Dependencies and their Inference Problem, 13 pp., March 1991

FU Berlin, Fachbereich Mathematik

• [6] J.A. Makowsky and S. Tulipani, Some Model Theory for Monotone Quantifiers, 42 pp., February, 1976
• [12] J.A. Makowsky, The Reals Cannot be Chracterized Topologically with Strictly Local Properties and Countability Axioms, 10 pp., June 1976
• [13] J.A. Makowsky and S. Shelah, The Theorems of Beth and Craig in Abstract Model Theory, 60 pp., June 1976
• [37] J.A. Makowsky, Elementary Equivalence and Definability in Stationary Logic, 21 pp., June 1977
• [54] J.A. Makowsky, Quantifying over countable sets: Positivie vs Stationary Logic, 11 pp., November 1977

Istituto Matematico `Ulisse Dini', Firenze, Italy

• [1974-75:17] J. A. Makowsky, An Extension of Topological First Order Logic with a Back and Forth Characterization of Elementary Equivalence, 15 pp., 1975

Mathematical Institute of the Hungarian Academy of Sciences

• [70-1985] J.A. Makowsky and I. Sain, On the equivalence of weak second order logic and nonstandard time semantics for Floyd--Hoare Logic, 7 pp., 1985