Szabolcs Mikulás

Affiliations:
  • Birkbeck, University of London, UK


According to our database1, Szabolcs Mikulás authored at least 36 papers between 1994 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
The Algebra of Non-deterministic Programs: Demonic Operations, Orders and Axioms.
Log. J. IGPL, 2022

Finite Model Properties for Residuated Semigroups.
CoRR, 2022

2020
The algebra of non-deterministic programs: demonic operators, orders and axioms.
CoRR, 2020

2019
Domain and range for angelic and demonic compositions.
J. Log. Algebraic Methods Program., 2019

2016
Relational lattices: From databases to universal algebra.
J. Log. Algebraic Methods Program., 2016

The finite representation property for composition, intersection, domain and range.
Int. J. Algebra Comput., 2016

2015
Complexity of equational theory of relational algebras with standard projection elements.
Synth., 2015

The equational theories of representable residuated semigroups.
Synth., 2015

Lower Semilattice-Ordered Residuated Semigroups and Substructural Logics.
Stud Logica, 2015

2014
The algebra of functions with antidomain and range.
CoRR, 2014

Relational Lattices.
Proceedings of the Relational and Algebraic Methods in Computer Science, 2014

2013
Ordered domain algebras.
J. Appl. Log., 2013

Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders.
Proceedings of the Frontiers of Combining Systems, 2013

2012
On canonicity and completions of weakly representable relation algebras.
J. Symb. Log., 2012

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

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

Positive Fragments of Relevance Logic and Algebras of Binary Relations.
Rev. Symb. Log., 2011

Axiomatizability of representable domain algebras.
J. Log. Algebraic Methods Program., 2011

On representable ordered residuated semigroups.
Log. J. IGPL, 2011

2009
Algebras of Relations and Relevance Logic.
J. Log. Comput., 2009

Axiomatizations for Temporal Epistemic Logic with Perfect Recall over Linear Time.
Proceedings of the TIME 2009, 2009

2002
An Elementary Construction for a Non-elementary Procedure.
Stud Logica, 2002

2001
Cylindric structures and dependencies in relational databases.
Theor. Comput. Sci., 2001

Products, or How to Create Modal Logics of High Complexity.
Log. J. IGPL, 2001

Expressiveness Issues and Decision Problems for Active Database Event Queries.
Proceedings of the Database Theory, 2001

Axiomatizability of algebras of binary relations.
Proceedings of the Classical and New Paradigms of Computation and their Complexity Hierarchies, 2001

2000
The Mosaic Method for Temporal Logics.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2000

1999
Undecidable Relativizations of Algebras of Relations.
J. Symb. Log., 1999

Decidability of Cylindric Set Algebras of Dimension Two and First-Order Logic with Two Variables.
J. Symb. Log., 1999

Tableau Calculus for Local Cubic Modal Logic and it's Implementation.
Log. J. IGPL, 1999

1998
Taming First-Order Logic.
Log. J. IGPL, 1998

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

Colorful reducts.
Proceedings of the Participants Copies for Relational Methods in Logic, 1998

1997
A note on expressing infinity in cylindrlc-relativised set algebras.
Proceedings of the Participants Copies of Third International Seminar on the Use of Relational Methods in Computer Science, 1997

1995
Taming Logic.
J. Log. Lang. Inf., 1995

1994
Lambek Calculus and its relational semantics: Completeness and incompleteness.
J. Log. Lang. Inf., 1994


  Loading...