Hajnal Andréka

J. Symb. Log., 2021

2020

Nonrepresentable Relation Algebras from Groups.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2020

2019

Nonrepresentable Relation Algebras from Groups - addendum.

[BibT_eX]

[DOI]

Rev. Symb. Log., 2019

2018

The Variety of coset Relation Algebras.

[BibT_eX]

[DOI]

J. Symb. Log., 2018

A representation theorem for measurable relation algebras.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 2018

2017

On Tarski's Axiomatic Foundations of the Calculus of Relations.

[BibT_eX]

[DOI]

J. Symb. Log., 2017

On A New Semantics for First-Order Predicate Logic.

[BibT_eX]

[DOI]

Johan van Benthem

J. Philos. Log., 2017

2014

Comparing Theories: The Dynamics of Changing Vocabulary.

[BibT_eX]

[DOI]

Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

2012

A logic road from special relativity to general relativity.

[BibT_eX]

[DOI]

Synth., 2012

Closed timelike Curves in relativistic Computation.

[BibT_eX]

[DOI]

Gergely Székely

Parallel Process. Lett., 2012

Decidability, Undecidability, and Gödel's Incompleteness in Relativity Theories.

[BibT_eX]

[DOI]

Judit X. Madarász

Parallel Process. Lett., 2012

Residuated Kleene Algebras.

[BibT_eX]

[DOI]

Szabolcs Mikulás

Proceedings of the Logic and Program Semantics, 2012

2011

The equational theory of Kleene lattices.

[BibT_eX]

[DOI]

Szabolcs Mikulás

Theor. Comput. Sci., 2011

2009

General relativistic hypercomputing and foundation of mathematics.

[BibT_eX]

[DOI]

Péter Németi

Nat. Comput., 2009

2008

Axiomatizing Relativistic Dynamics without Conservation Postulates.

[BibT_eX]

[DOI]

Stud Logica, 2008

Omitting types for finite variable fragments and complete representations of algebras.

[BibT_eX]

[DOI]

Tarek Sayed Ahmed

J. Symb. Log., 2008

2007

Logic of Space-Time and Relativity Theory.

[BibT_eX]

[DOI]

Judit X. Madarász

Proceedings of the Handbook of Spatial Logics, 2007

2006

New Physics and Hypercomputation.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Can General Relativistic Computers Break the Turing Barrier?.

[BibT_eX]

[DOI]

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Mutual definability does not imply definitional equivalence, a simple example.

[BibT_eX]

[DOI]

Judit X. Madarász

Math. Log. Q., 2005

2002

Operators and Laws for Combining Preference Relations.

[BibT_eX]

[DOI]

Mark Ryan

Pierre-Yves Schobbens

J. Log. Comput., 2002

Groups and algebras of nary relations.

[BibT_eX]

[DOI]

Bull. Symb. Log., 2002

1999

Finite Algebras of Relations Are Representable on Finite Sets.

[BibT_eX]

[DOI]

Ian M. Hodkinson

J. Symb. Log., 1999

1998

Relativised Quantification: Some Canonical Varieties of Sequence-Set Algebras.

[BibT_eX]

[DOI]

Robert Goldblatt

J. Symb. Log., 1998

Modal Languages and Bounded Fragments of Predicate Logic.

[BibT_eX]

[DOI]

Johan van Benthem

J. Philos. Log., 1998

Notions of Density That Imply Representability in Algebraic Logic.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1998

1997

Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1997

Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability.

[BibT_eX]

[DOI]

Ann. Pure Appl. Log., 1997

The finite base property for some cylindric-relativized algebras (Abstract).

[BibT_eX]

Ian M. Hodkinson

Proceedings of the Participants Copies of Third International Seminar on the Use of Relational Methods in Computer Science, 1997

Decision problems for equational theories of relation algebras.

[BibT_eX]

Memoirs of the American Mathematical Society 126, American Mathematical Society, ISBN: 978-0-8218-0595-4, 1997

1995

Binary Relations and Permutation Groups.

[BibT_eX]

[DOI]

Ivo Düntsch

Math. Log. Q., 1995

Perfect Extensions and Derived Algebras.

[BibT_eX]

[DOI]

J. Symb. Log., 1995

Expressibility of Properties of Relations.

[BibT_eX]

[DOI]

Ivo Düntsch

J. Symb. Log., 1995

Back and Forth Between Modal Logic and Classical Logic.

[BibT_eX]

[DOI]

Johan van Benthem

Log. J. IGPL, 1995

1994

Representations for Small Relation Algebras.

[BibT_eX]

[DOI]

Roger D. Maddux

Notre Dame J. Formal Log., 1994

Connections Between Axioms of Set Theory and Basic Theorems of Universal Algebra.

[BibT_eX]

[DOI]

Ágnes Kurucz

J. Symb. Log., 1994

The Lattice of Varieties of Representable Relation Algebras.

[BibT_eX]

[DOI]

J. Symb. Log., 1994

Lambek Calculus and its relational semantics: Completeness and incompleteness.

[BibT_eX]

[DOI]

Szabolcs Mikulás

J. Log. Lang. Inf., 1994

1993

Applying Algebraic Logic to Logic.

[BibT_eX]

Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1991

On the Strength of Temporal Proofs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1991

1990

Weak Cylindric Set Algebra and Weak Subdirect Indecomposability.

[BibT_eX]

[DOI]

R. J. Thompson

J. Symb. Log., 1990

1989

Algebraic Logic Conference.

[BibT_eX]

[DOI]

J. Symb. Log., 1989

1988

A System of Logic for Partial Functions Under Existence-Dependent Kleene Equality.

[BibT_eX]

[DOI]

William Craig

J. Symb. Log., 1988

On Residuated Approximations.

[BibT_eX]

[DOI]

R. J. Greechie

George E. Strecker

Proceedings of the Categorial Methods in Computer Science: With Aspects from Topology [Workshop, 1988

Relatively free relation algebras.

[BibT_eX]

[DOI]

Bjarni Jónsson

Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988

1987

A Unifying Theorem for Algebraic Semantics and Dynamic Logics

[BibT_eX]

[DOI]

Irène Guessarian

Inf. Comput., January, 1987

1985

On the Number of Generators of Cylindric Algebras.

[BibT_eX]

[DOI]

J. Symb. Log., 1985

1982

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1982

1981

A Characterization of Floyd-Provable Programs.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1981, Strbske Pleso, Czechoslovakia, August 31, 1981

Some Universal Algebraic and Model Theoretic Results in Computer Science.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 1981

1980

Sharpening the characterization of the power of Floyd method.

[BibT_eX]

[DOI]

Proceedings of the Logics of Programs and Their Applications, 1980

Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies.

[BibT_eX]

[DOI]

Tamás Gergely

Proceedings of the 8th International Conference on Computational Linguistics, 1980

1979

Completeness Problems in Verification of Programs and Program Schemes.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Henkin-type semantics for program-schemes to turn negative results to positive.

[BibT_eX]

Proceedings of the Fundamentals of Computation Theory, 1979

1978

The generalized completeness of Horn predicate-logic as a programming language.

[BibT_eX]

[DOI]

Acta Cybern., 1978

1975

Definition Theory as Basis for a Creative Problem Solver.

[BibT_eX]

[DOI]

T. Gorgely

Proceedings of the Advance Papers of the Fourth International Joint Conference on Artificial Intelligence, 1975

On the Role of Mathematical Language Concept in the Theory of Intelligent Systems.

[BibT_eX]

[DOI]

Tamás Gergely

Proceedings of the Advance Papers of the Fourth International Joint Conference on Artificial Intelligence, 1975

1973

Notes on maximal congruence relations, automata and related topics.

[BibT_eX]

[DOI]

Sándor Horváth