Papers, abstracts, preprints and manuscripts
in reversed chronological order
- Sain,I. and Simon,A.:
The Complexity of Equational Theory of Relational
Algebras with Standard Projection Elements.
Preprint, Rényi Institute of Mathematics, Budapest 2004, 18pp.
- Andréka,H., Németi,I. and Sain,I.:
Algebraic Logic.
In: Handbook of Philosophical Logic Vol.II, 2-nd Edition.
Editors: D. M. Gabbay and F. Guenthner.
Kluwer Academic Publishers, 2001, 133-247.
Preprint version.
- Sain,I.:
On the search for a finitizable algebraization of
first order logic.
Logic Journal of the IGPL, July 2000, vol.8, no.4, 495-589.
Electronically available: http://www.jigpal.oupjournals.org.
- Németi,I. and Sain,I.:
Editorial.
Logic Journal of the IGPL, July 2000, vol.8, no.4, 377-379.
Electronically available: http://www.jigpal.oupjournals.org.
- Sain,I. and Németi,I.:
Fork Algebras in Usual and in Non-well-founded Set Theories
(An Overview).
In: Logic at Work (Essays Dedicated to the Memory of Helena Rasiowa),
"Studies in Fuzziness and Soft Computing" series.
Editor: E. Orlowska
Physica-Verlag, a Springer-Verlag Company, Heidelberg New York.
1999, 669-694.
Preprint version.
- Sain,I.:
On Characterizations of Definability Properties in
Abstract Algebraic Logic,
In: Proceedings of the "Workshop on Abstract Algebraic Logic".
Editors: J. M. Font, R. Jansana and D. Pigozzi.
C.R.M. series 'Quaderns'
(`Centre de Recerca Matematica' of the 'Institut d'Estudis Catalans')
Jan. 1998, 15 pp.
- Sain,I. and Gyuris,V.:
Finite Schematizable Algebraic Logic.
Logic Journal of the IGPL, September 1997, vol.5, no.5, 699-751.
Electronically available: http://www.jigpal.oupjournals.org.
- Marx,M., Mikulás,S., Németi,I. and Sain,I.:
Investigations in Arrow Logics.
In: Arrow logic and multi-modal logic.
Editors: M. Marx, M. Masuch and L. Pólos.
"Studies in Logic, Language and Computation" series,
CSLI Publications, Stanford, 1996, 35-61.
- Andréka,H., Kurucz,Á., Németi,I., Sain,I. and
Simon,A.:
Causes and remedies for undecidability in arrow logics and in
multimodal logics.
In: Arrow logic and multi-modal logic.
Editors: M. Marx, M. Masuch and L. Pólos.
"Studies in Logic, Language and Computation" series,
CSLI Publications, Stanford, 1996, 63-99.
- Marx,M., Mikulás,S., Németi,I., and Sain,I.:
Investigations in Arrow Logics.
In: Arrow logic and multi--modal logic.
Editors: M. Marx, M. Masuch and L. Pólos.
"Studies in Logic, Language and Computation" series,
CSLI Publications, Stanford, 1996, 35-61.
- Andréka,H., Goranko,V., Mikulás,S., Németi,I.
and Sain,I.:
Effective First Order Temporal Logics.
In: Time and Logic, a computational approach.
Editors: L. Bolc and A. Szalas.
UCL Press Ltd., London, 1995, 51-129.
- Andréka,H., Kurucz,Á., Németi,I., Sain,I.
and Simon,A.:
Decidable and undecidable logics with a binary modality.
Journal of Logic, Language and Information, 1995, vol.4, 191-206.
- Andréka,H., Németi,I., Sain,I. and Kurucz,Á.:
General Algebraic Logic including Algebraic Model Theory:
An Overview.
In: Logic Colloquium'92 (Proc. Veszprém, Hungary, 1992).
Editors: L. Csirmaz, D. M. Gabbay and M. de Rijke.
"Studies in Logic, Language and Computation" series,
CSLI Publications, Stanford, 1995, 1-60.
- Kurucz,Á., Németi,I., Sain,I. and Simon.A.:
Decidable and Undecidable Logics with a Binary Modality.
Journal of Logic, Language and Information, 1995, vol.4, 191-206.
- Mikulás,S., Németi,I. and Sain,I.:
Decidable Logics of the Dynamic Trend, and Relativized Relation Algebras.
In: Logic Colloquium'92 (Proc. Veszprém, Hungary, 1992).
Editors: L. Csirmaz, D. M. Gabbay and M. de Rijke.
"Studies in Logic, Language and Computation" series,
CSLI Publications, Stanford, 1995, 165-175.
- Németi,I., Simon,A. and Sain,I.:
Undecidable of the Equational Theory of Some Classes of Residuated
Boolean Algebras with Operators (Extended Abstract).
Bulletin of the IGPL, 1995, vol.3, no.1, 93-105.
- Sain, I.:
On the Problem of Finitizing First Order Logic and its
Algebraic Counterpart (A Survey of Results and Methods)
In: Logic Colloquium'92 (Proc. Veszprém, Hungary, 1992).
Editors: L. Csirmaz, D. M. Gabbay and M. de Rijke.
"Studies in Logic, Language and Computation" series,
CSLI Publications, Stanford, 1995, 243-292.
- Sain, I. and Németi,I.:
Fork Algebras in Usual and in Non--well--founded Set Theories
(Extended abstract) Part I and Part II.
Bulletin of the Section of Logic, 1995, vol.24, no's 3 and 4,
158-168 and 182-192.
- Andréka,H., Kurucz,Á., Németi,I., Sain,I.
and Simon,A.:
Exactly which logics touched by the dynamic trend are undecidable?.
In: Proceedings of the Ninth Amsterdam Colloquium
(December 14--17, 1993, Amsterdam).
Editors: P. Dekker and M. Stokhof.
ILLC, Dept. of Philosophy, Univ. of Amsterdam, 1994, 67-86.
- Andréka,H., Németi,I. and Sain,I.:
Some New Landmarks on the Roadmap of Two Dimensional Logics.
In: Logic and Information Flow.
Editors: J. van Eijck and A. Visser.
MIT Press, Cambridge, Mass., 1994, 163-169.
- Andréka,H., Németi,I. and Sain,I.:
Applying Algebraic Logic to Logic.
In: Algebraic Methodology and Software Technology
(AMAST'93, Proceedings of the Third International
Conference on Algebraic Methodology and Software Technology,
The Netherlands, 21-25 June 1993).
University of Twente.
Editors: M. Nivat, C. Rattray, T. Rus and G. Scollo.
"Workshops in Computing" series,
Springer-Verlag, London, 1994, 5-26.
- Andréka,H., Németi,I. and Sain,I.:
Craig Property of a Logic and Decomposability of Theories.
In: Proceedings of the Ninth Amsterdam Colloquium (December 14-17,
1993, Amsterdam).
Editors: P. Dekker and M. Stokhof.
ILLC, Dept. of Philosophy, Univ. of Amsterdam, 1994, 87-93.
- Andréka,H., Németi,I. and Sain,I.:
Universal Algebraic Basics for Algebraic Logic.
Manuscript, 1994, 72 TeX pages.
- Andréka,H., Németi,I. and Sain,I.:
On Interpolation, Amalgamation, Universal Algebra and
Boolean Algebras with Operators.
Alfr{\'e}d R{\'e}nyi Institute of Mathematics, Preprint, Budapest, 1994.
- Andréka,H., Németi,I., Sain,I. and Kurucz,Á.:
Applying Algebraic Logic to Logic; A General Methodology.
Lecture Notes of the Summer School
"Algebraic Logic and the Methodology of Applying it", Budapest 1994, 67 pages.
Also: Research Report of the Math. Inst. Budapest, 1994.
Here is a revised version.
- Sain, I.:
On finitizing first order logic.
Bulletin of the Section of Logic. Univ. of Wroclaw, 1994, vol.23, no.2, 66-79.
- Sain, I.:
Fork Algebras in Usual as well as in Non-well-founded Set Theories.
Newsletter of the SIGALA
(Special Interest Group on Algebraic Logic and its Applications), 1994,
vol.2, no.1, 23-26.
- Sain, I.:
Fork Algebras in Usual as well as in Non-well-founded Set Theories.
Relational Methods in Computer Science, Dagstuhl-Seminar-Report, 1994,
vol.[80, 17.01.-21.01.94 (9403)], 17-19.
- Biró,B. and Sain,I.:
Peano Arithmetic for the Time Scales of Nonstandard Models
for Logics of Programs.
Annals of Pure and Applied Logic, 1993, vol.63, 201-225.
- Kurucz,Á., Németi,I., Sain,I. and Simon,A.:
Undecidable Varieties of Semilattice-ordered Semigroups, of Boolean
Algebras with Operators, and Logics Extending Lambek Calculus.
Bulletin of the IGPL, 1993, vol.1, 91-98.
- Sain, I.:
Comparing and characterizing the powers of established program
verification methods.
In: Many-sorted Logic and its Applications.
Editors: K. Meinke and J. V. Tucker.
John Wiley and Sons Ltd. (Chichester, New York etc.), 1993, 215-314.
- Sain, I.:
Weak products of universal algebras.
In: Algebraic Methods in Logic and in Computer Science.
"Banach Center Publications" series, vol.28,
Institute of Mathematics, Polish Academy of Sciences, Warsaw, 1993, 311-318.
- Mikulás,S., Sain, I. and Simon,A.:
Complexity of Equational Theory of Relational Algebras with Projection
Elements.
Bulletin of the Section of Logic, Univ. of Lódz, 1992, vol.21,
no.3, 103-111.
- Sain, I.:
Temporal Logics Need their Clocks.
Theoretical Computer Science, 1992, vol.95, 75-95.
- Andréka,H., Németi,I. and Sain,I.:
On the strength of temporal proofs.
Theoretical Computer Science, 1991, vol.80, 125-151.
- Andréka,H., Németi,I. and Sain,I.:
Algebraic Logic.
Lecture Notes for Logic Graduate School, Budapest, 1991, 137 pages.
- Sain,I. and Simon,A.:
The Complexity of Equational Theory of Relational Algebras
with Projection Elements.
Preprint of Math. Inst. Hungar. Acad. Sci., Budapest, 1991, 18 pages.
- Sain,I. and Thompson,R.J.:
Strictly Finite Schema Axiomatization of Quasi-polyadic Algebras.
In: Algebraic Logic (Proc. Conf. Budapest 1988).
Editors: H. Andréka, J. D. Monk and I. Németi.
"Colloq. Math. Soc. János Bolyai" series,
North-Holland, Amsterdam, vol.54, 1991, 539-571.
- Pasztor,A. and Sain,I.:
A streamlined temporal completeness theorem.
In: Computer Science Logics 1989
(CSL'89, Proc. Conf. Kaiserslautern Germany, 1989. VI, 437 pages).
Editors: E. B"orger, H. Kleine B"uning and M. M. Richter.
"Lecture Notes in Computer Science" series, vol.440, Springer--Verlag,
Berlin, 1990, 322-336.
- Sain,I.:
Beth's and Craig's properties via epimorphisms and amalgamation in
algebraic logic.
In: Algebraic Logic and Universal Algebra in Computer Science.
Editors: C. H. Bergman, R. D. Maddux and D. L. Pigozzi.
Lecture Notes in Computer Science, vol.425, Springer-Verlag, Berlin,
1990, 209-226.
- Sain,I.",
Results on the glory of the past.
In: Mathematical Foundations of Computer Science 1990.
Editor: B. Rovan.
Lecture Notes in Computer Science, vol.452, Springer-Verlag, Berlin,
1990, 478-484.
- Sain,I.:
Past proves more invariant properties but not pca's.
In: Aspects and Prospects of Theoretical Computer Science
(Proceedings of the 6th International Meeting of Young Computer Scientists
1990 (IMYCS'90).
Editors: J. Dassow and J. Kelemen.
Lecture Notes in Computer Science, vol.464, Springer-Verlag, Berlin,
1990, 80-92.
- Andréka,H., Németi,I. and Sain,I.:
On the strength of temporal proofs (extended abstract).
In: Mathematical Foundations of Computer Science 1989.
Editors: A. Kreczmar and G. Mirkowska.
"Lecture Notes in Computer Science" series, Springer-Verlag, Berlin,
vol.379, 1989, 135-144.
- Makowsky,J.A. and Sain,I.:
Weak second order characterizations of various program verification systems.
Theoretical Computer Science, 1989, vol.66, 299-321.
- Németi,I. and Sain,I.:
Abstract model theoretic definability properties in algebraic logic.
In: Abstracts of Logic Colloquium 89
(European Summer Meeting of the Association for Symbolic Logic).
Berlin, Association for Symbolic Logic, July 1989.
- Németi,I. and Sain,I.:
Relative powers of modal and temporal logics of programs for
proving total correctness, nondeterministic invariance properties,
and other properties of processes.
In: Abstracts of Logic Colloquium 89
(European Summer Meeting of the Association for Symbolic Logic).
Berlin, Association for Symbolic Logic, July 1989.
- Sain,I.:
Amalgamation, epimorphisms, and definability properties in algebraic logic.
Bulletin of the Section of Logic, Univ. of Lódz, vol.18, no.2,
1989, 72-78.
- Sain,I.:
Elementary proof for some semantic characterizations of nondeterministic
Floyd-Hoare logic.
Notre Dame Journal of Formal Logic, 1989, vol.30, no.4, 563-57.
- Sain,I.:
Computer science temporal logics need their clocks.
Bulletin of the Section of Logic, Warsaw-Lódz, vol.18, no.4,
1989, 153-160.
- Sain,I.:
Computer science temporal logics need clocks.
Abstracts Amer. Math. Soc., 1989.
- Sain,I.:
Amalgamation and epimorphisms in algebraic logic.
Abstracts Amer. Math. Soc., March 1989, vol.10,62, no.2, *89T--03--68,
p.172.
- Sain,I.:
Concerning Some Cylindric Algebra Versions of the Downward
L"owenheim-Skolem Theorem.
Notre Dame Journal of Formal Logic, 1988, vol.29, no.3, 332-344.
- Sain,I.:
Is "Some-Other-Time" sometimes better than "Sometime" in proving
partial correctness of programs?.
Studia Logica, 1988, vol.XLVII, no.3, 279-301.
- Sain,I.:
A finitary algebraization of first order logic.
Abstracts Amer. Math. Soc., November 1988, vol.9,60, no.6, *88T--03--262,
p.500.
- Sain,I.:
On the Search for a Finitizable Algebraization of First Order Logic
(Shortened Version A).
Preprint of Math. Inst. Hungar. Acad. Sci., 1988, 78 pages.
- Sain,I.:
Total correctness in nonstandard logics of programs.
Theoretical Computer Science, 1987, vol.50, 285-321.
- Sain,I.:
Positive Results related to the Jónsson,
Tarski-Givant Representation Problem.
Preprint of Math. Inst. Hungar. Acad. Sci., Budapest, #1987/54, 1987,
7 pages.
- Sain,I.:
On the Search for a Finitizable Algebraization of First Order Logic.
Preprint of Math. Inst. Hungar. Acad. Sci., Budapest, #1987/53, 1987,
58 pages.
- Makowsky,J.A. and Sain,I.:
On the equivalence of weak second order and nonstandard time
semantics for various program verification systems.
In: Logic in Computer Science (Proc. Conf. Cambridge USA 1986).
vol.193, IEEE Computer Society Press, 1986, 293-300.
- Sain,I.:
Dynamic logic with nonstandard model theory.
Dissertation with the Hung. Academy of Sci., Budapest, 1986, ix+180 pages
(in Hungarian).
- Sain,I.:
A simple proof for completeness of {F}loyd method.
Theoretical Computer Science, 1985, vol.35, 345-348.
- Sain,I.:
The reasoning powers of Burstall's (modal logic) and Pnueli's
(temporal logic) program verification methods.
In: Logics of Programs, Proc. Conf. Brooklyn USA 1985.
Editor: R. Parikh.
Lecture Notes in Computer Science, vol.193, Springer-Verlag, 1985,
302-319.
- Sain,I.:
Model theoretic methods in computer science logics.
In: Abstracts of Logic Colloquium 85
(European Summer Meeting of the Association for Symbolic Logic).
Paris, Association for Symbolic Logic, 1985.
- Sain,I.:
Structured Nonstandard Dynamic Logic.
Zeitschrift f"ur Math. Logic und Grundlagen der Math., 1984, vol.30,
no.3, 481-497.
- Sain,I.:
Total correctness in nonstandard dynamic logic.
Bulletin of the Section of Logic, Wroclaw-Lódz, vol.12, no.2,
1983, 64-70.
- Sain,I. and Bui Huy Hien:
In which categories are first order axiomatizable hulls characterizable
by ultraproducts?.
Cahiers Top. Géo. Diff., 1983, vol.XXIV--2, 215-222.
- Sain,I. and Bui Huy Hien:
Category theoretic notions of ultraproducts.
Studia Sci. Math. Hungar., 1983, vol.18, 309-317.
- Andréka,H., Németi,I. and Sain,I.:
A complete logic for reasoning about programs via nonstandard model
theory, Parts I-II.
Theoretical Computer Science, 1982, vol.17, no's 2 and 3,
193-212 and 259-278, resp.
- Sain,I.:
Weak products for universal algebra and model theory.
Diagrammes, Univ. Paris VII, vol.31, no.1-3, 1982, pages S1--S15.
- Sain,I.:
Finitary Logics of Infinitary Structures are Compact.
Abstracts Amer. Math. Soc., 1982, vol.3, p.252.
- Sain,I.:
Solutions of problems in cylindric algebra theory.
Abstracts Amer. Math. Soc., June 1982, vol.3,18, no.4, *82T--03--259,
p.281.
- Sain,I.:
Strong Amalgamation and Epimorphisms of Cylindric Algebras and
Boolean Algebras with Operators.
Preprint of Math. Inst. Hungar. Acad. Sci., Budapest, #1982/17, 1982,
44 pages.
- Andréka,H., Németi,I. and Sain,I.:
A characterization of Floyd-provable programs.
In: Mathematical Foundations of Computer Science'81
(Proc. Conf. Strbské Pleso Czechoslovakia 1981).
Editors: J. Gruska and M. Chytil.
Springer-Verlag, Berlin, "Lecture Notes in Computer Science" series,
vol.118, 1981, 162-171.
- Andréka,H. and Sain,I.:
Connections between algebraic logic and initial algebra semantics of
CF languages.
In: Mathematical Logic in Computer Science
(Proc. Conf. Salgótarján Hungary 1978).
Editors: B. D"om"olki and T. Gergely.
Colloq. Math. Soc. J. Bolyai - North-Holland,
"Colloq. Math. Soc. J. Bolyai" series, 1981, vol.26, 25-83.
- Németi,I. and Sain,I.:
Cone-implicational subcategories and some Birkhoff-type theorems.
In: Universal Algebra (Proc. Conf. Esztergom Hungary 1977).
Editor: L. Márki.
Colloq. Math. Soc. J. Bolyai - North-Holland,
"Colloq. Math. Soc. J. Bolyai" series, vol.29, 1981, 535-578.
- Sain,I.:
First order dynamic logic with decidable proofs and workeable model theory.
In: Fundamentals of Computation Theory'81
(Proc. Conf. Szeged Hungary 1981).
Editor: F. Gécseg.
"Lecture Notes in Computer Science" series, vol.117, Springer-Verlag,
1981, 334-340.
- Sain,I.:
On classes of algebraic systems closed w.r.t. quotients.
In: Algebra and its applications.
"Banach Center Publications" series, vol.9,
PWN-Polish Scientific Publishers, Warsawa, 1980, 127-131.
- Andréka,H., Németi,I. and Sain,I.:
Completeness problems in verification of programs and program schemes.
In: Mathematical Foundations of Computer Science'79
(Proc. Conf. Olomouc Czechoslovakia 1979).
Editor: J. Becvár, Springer-Verlag, Berlin, vol.74,
"Lecture Notes in Computer Science" series, 1979, 208-218.
- Andréka,H., Németi,I. and Sain,I.:
Henkin-type semantics for program schemes to turn negative results
to positive.
In: Fundamentals of Computation Theory'79 (Proc. Conf. Berlin 1979).
Editor: L. Budach.
Akademie Verlag, Berlin, 1979, 18-24.
- Andréka,H., Németi,I. and Sain,I.:
Program verification within and without logic.
Bulletin of the Section of Logic, Univ. of Wroclaw, vol.8, no.3, 1979,
124-130.
- Sain,I.:
There are general rules for specifying semantics:
Observations on Abstract Model Theory.
CL&CL (Computational Linguistics and Computer Languages), 1979,
vol.XIII, 195-250.
- Sain,I.:
On the applicability of different category theoretic notions
of ultraproducts.
(In Hungarian.)
Matematikai Lapok, vol.31, no.1-3, 1978-83, 143-167.
- Gergely,T. Németi,I. and Sain,I.:
Category theory for universal algebras.
Preprint of Central Research Institute for Physics, Budapest,
#1982/17, 1976, KFKI--76-5.
- Sain,I.:
Category theory for investigating algebraic structures.
(In Hungarian.)
Számológép (Kisk"onyvtár k"ul"onkiadás),
vol.V, no.74/4, 1974, 57-12.