Hajnal Andréka

According to our database1, Hajnal Andréka authored at least 56 papers between 1973 and 2018.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2018
The Variety of coset Relation Algebras.
J. Symb. Log., 2018

A representation theorem for measurable relation algebras.
Ann. Pure Appl. Logic, 2018

2017
On Tarski's Axiomatic Foundations of the Calculus of Relations.
J. Symb. Log., 2017

On A New Semantics for First-Order Predicate Logic.
J. Philosophical Logic, 2017

2014
Comparing Theories: The Dynamics of Changing Vocabulary.
Proceedings of the Johan van Benthem on Logic and Information Dynamics, 2014

2012
A logic road from special relativity to general relativity.
Synthese, 2012

Closed timelike Curves in relativistic Computation.
Parallel Processing Letters, 2012

Decidability, Undecidability, and Gödel's Incompleteness in Relativity Theories.
Parallel Processing Letters, 2012

Residuated Kleene Algebras.
Proceedings of the Logic and Program Semantics, 2012

2011
The equational theory of Kleene lattices.
Theor. Comput. Sci., 2011

2009
General relativistic hypercomputing and foundation of mathematics.
Natural Computing, 2009

2008
Axiomatizing Relativistic Dynamics without Conservation Postulates.
Studia Logica, 2008

Omitting types for finite variable fragments and complete representations of algebras.
J. Symb. Log., 2008

2007
Logic of Space-Time and Relativity Theory.
Proceedings of the Handbook of Spatial Logics, 2007

2006
New Physics and Hypercomputation.
Proceedings of the SOFSEM 2006: Theory and Practice of Computer Science, 2006

Can General Relativistic Computers Break the Turing Barrier?.
Proceedings of the Logical Approaches to Computational Barriers, 2006

2005
Mutual definability does not imply definitional equivalence, a simple example.
Math. Log. Q., 2005

2002
Operators and Laws for Combining Preference Relations.
J. Log. Comput., 2002

Groups and algebras of nary relations.
Bulletin of Symbolic Logic, 2002

1999
Finite Algebras of Relations Are Representable on Finite Sets.
J. Symb. Log., 1999

1998
Relativised Quantification: Some Canonical Varieties of Sequence-Set Algebras.
J. Symb. Log., 1998

Modal Languages and Bounded Fragments of Predicate Logic.
J. Philosophical Logic, 1998

Notions of Density That Imply Representability in Algebraic Logic.
Ann. Pure Appl. Logic, 1998

1997
Complexity of Equations Valid in Algebras of Relations: Part II: Finite Axiomatizations.
Ann. Pure Appl. Logic, 1997

Complexity of Equations Valid in Algebras of Relations: Part I: Strong Non-Finitizability.
Ann. Pure Appl. Logic, 1997

The finite base property for some cylindric-relativized algebras (Abstract).
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.
Memoirs of the American Mathematical Society 126, American Mathematical Society, ISBN: 978-0-8218-0595-4, 1997

1995
Binary Relations and Permutation Groups.
Math. Log. Q., 1995

Perfect Extensions and Derived Algebras.
J. Symb. Log., 1995

Expressibility of Properties of Relations.
J. Symb. Log., 1995

Back and Forth Between Modal Logic and Classical Logic.
Logic Journal of the IGPL, 1995

1994
Representations for Small Relation Algebras.
Notre Dame Journal of Formal Logic, 1994

Connections Between Axioms of Set Theory and Basic Theorems of Universal Algebra.
J. Symb. Log., 1994

The Lattice of Varieties of Representable Relation Algebras.
J. Symb. Log., 1994

Lambek Calculus and its relational semantics: Completeness and incompleteness.
Journal of Logic, Language and Information, 1994

1993
Applying Algebraic Logic to Logic.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1991
On the Strength of Temporal Proofs.
Theor. Comput. Sci., 1991

1990
Weak Cylindric Set Algebra and Weak Subdirect Indecomposability.
J. Symb. Log., 1990

1989
Algebraic Logic Conference.
J. Symb. Log., 1989

1988
A System of Logic for Partial Functions Under Existence-Dependent Kleene Equality.
J. Symb. Log., 1988

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

Relatively free relation algebras.
Proceedings of the Algebraic Logic and Universal Algebra in Computer Science, Conference, 1988

1987
A Unifying Theorem for Algebraic Semantics and Dynamic Logics
Inf. Comput., January, 1987

1985
On the Number of Generators of Cylindric Algebras.
J. Symb. Log., 1985

1982
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II.
Theor. Comput. Sci., 1982

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I.
Theor. Comput. Sci., 1982

1981
A Characterization of Floyd-Provable Programs.
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.
Proceedings of the Fundamentals of Computation Theory, 1981

1980
Sharpening the characterization of the power of Floyd method.
Proceedings of the Logics of Programs and Their Applications, 1980

Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies.
Proceedings of the 8th International Conference on Computational Linguistics, 1980

1979
Completeness Problems in Verification of Programs and Program Schemes.
Proceedings of the Mathematical Foundations of Computer Science 1979, 1979

Henkin-type semantics for program-schemes to turn negative results to positive.
Proceedings of the Fundamentals of Computation Theory, 1979

1978
The generalized completeness of Horn predicate-logic as a programming language.
Acta Cybern., 1978

1975
Definition Theory as Basis for a Creative Problem Solver.
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.
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.
Acta Cybern., 1973


  Loading...