default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSzabolcs Mikulás
Person information
- affiliation: Birkbeck, University of London, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j24]Robin Hirsch, Szabolcs Mikulás, Timothy Stokes:
The Algebra of Non-deterministic Programs: Demonic Operations, Orders and Axioms. Log. J. IGPL 30(5): 886-906 (2022)- [i5]Szabolcs Mikulás:
Finite Model Properties for Residuated Semigroups. CoRR abs/2211.11685 (2022) - 2020
- [i4]Robin Hirsch, Szabolcs Mikulás, Tim Stokes:
The algebra of non-deterministic programs: demonic operators, orders and axioms. CoRR abs/2009.12081 (2020)
2010 – 2019
- 2019
- [j23]Marcel Jackson
, Szabolcs Mikulás:
Domain and range for angelic and demonic compositions. J. Log. Algebraic Methods Program. 103: 62-78 (2019) - 2018
- [i3]Marcel Jackson, Szabolcs Mikulás:
Domain and range for angelic and demonic compositions. CoRR abs/1811.01712 (2018) - 2016
- [j22]Brett McLean, Szabolcs Mikulás:
The finite representation property for composition, intersection, domain and range. Int. J. Algebra Comput. 26(6): 1199-1215 (2016) - [j21]Tadeusz Litak, Szabolcs Mikulás, Jan Hidders:
Relational lattices: From databases to universal algebra. J. Log. Algebraic Methods Program. 85(4): 540-573 (2016) - 2015
- [j20]Szabolcs Mikulás:
Lower Semilattice-Ordered Residuated Semigroups and Substructural Logics. Stud Logica 103(3): 453-478 (2015) - [j19]Szabolcs Mikulás:
The equational theories of representable residuated semigroups. Synth. 192(7): 2151-2158 (2015) - [j18]Szabolcs Mikulás, Ildikó Sain, András Simon:
Complexity of equational theory of relational algebras with standard projection elements. Synth. 192(7): 2159-2182 (2015) - [i2]Brett McLean, Szabolcs Mikulás:
The finite representation property for composition, intersection, domain and range. CoRR abs/1503.02627 (2015) - 2014
- [c9]Tadeusz Litak, Szabolcs Mikulás, Jan Hidders:
Relational Lattices. RAMiCS 2014: 327-343 - [i1]Robin Hirsch, Marcel Jackson, Szabolcs Mikulás:
The algebra of functions with antidomain and range. CoRR abs/1410.3981 (2014) - 2013
- [j17]Robin Hirsch, Szabolcs Mikulás:
Ordered domain algebras. J. Appl. Log. 11(3): 266-271 (2013) - [c8]Philippe Balbiani, Szabolcs Mikulás:
Decidability and Complexity via Mosaics of the Temporal Logic of the Lexicographic Products of Unbounded Dense Linear Orders. FroCos 2013: 151-164 - 2012
- [j16]Ian M. Hodkinson, Szabolcs Mikulás:
On canonicity and completions of weakly representable relation algebras. J. Symb. Log. 77(1): 245-262 (2012) - [c7]Hajnal Andréka, Szabolcs Mikulás, István Németi:
Residuated Kleene Algebras. Logic and Program Semantics 2012: 1-11 - 2011
- [j15]Szabolcs Mikulás:
On representable ordered residuated semigroups. Log. J. IGPL 19(1): 233-240 (2011) - [j14]Robin Hirsch, Szabolcs Mikulás:
Axiomatizability of representable domain algebras. J. Log. Algebraic Methods Program. 80(2): 75-91 (2011) - [j13]Robin Hirsch, Szabolcs Mikulás:
Positive Fragments of Relevance Logic and Algebras of Binary Relations. Rev. Symb. Log. 4(1): 81-105 (2011) - [j12]Hajnal Andréka, Szabolcs Mikulás, István Németi:
The equational theory of Kleene lattices. Theor. Comput. Sci. 412(52): 7099-7108 (2011)
2000 – 2009
- 2009
- [j11]Szabolcs Mikulás:
Algebras of Relations and Relevance Logic. J. Log. Comput. 19(2): 305-321 (2009) - [c6]Szabolcs Mikulás, Mark Reynolds, Tim French:
Axiomatizations for Temporal Epistemic Logic with Perfect Recall over Linear Time. TIME 2009: 81-87 - 2002
- [j10]Maarten Marx, Szabolcs Mikulás:
An Elementary Construction for a Non-elementary Procedure. Stud Logica 72(2): 253-263 (2002) - 2001
- [j9]Maarten Marx, Szabolcs Mikulás:
Products, or How to Create Modal Logics of High Complexity. Log. J. IGPL 9(1): 71-82 (2001) - [j8]Ivo Düntsch, Szabolcs Mikulás:
Cylindric structures and dependencies in relational databases. Theor. Comput. Sci. 269(1-2): 451-468 (2001) - [c5]Szabolcs Mikulás:
Axiomatizability of algebras of binary relations. FotFS 2001: 187-205 - [c4]James Bailey, Szabolcs Mikulás:
Expressiveness Issues and Decision Problems for Active Database Event Queries. ICDT 2001: 68-82 - 2000
- [c3]Maarten Marx, Szabolcs Mikulás, Mark Reynolds:
The Mosaic Method for Temporal Logics. TABLEAUX 2000: 324-340
1990 – 1999
- 1999
- [j7]Maarten Marx, Szabolcs Mikulás, Stefan Schlobach:
Tableau Calculus for Local Cubic Modal Logic and it's Implementation. Log. J. IGPL 7(6): 755-778 (1999) - [j6]Szabolcs Mikulás, Maarten Marx:
Undecidable Relativizations of Algebras of Relations. J. Symb. Log. 64(2): 747-760 (1999) - [j5]Maarten Marx, Szabolcs Mikulás:
Decidability of Cylindric Set Algebras of Dimension Two and First-Order Logic with Two Variables. J. Symb. Log. 64(4): 1563-1572 (1999) - 1998
- [j4]Hajnal Andréka, Steven Givant, Szabolcs Mikulás, István Németi, András Simon:
Notions of Density That Imply Representability in Algebraic Logic. Ann. Pure Appl. Log. 91(2-3): 93-190 (1998) - [j3]Szabolcs Mikulás:
Taming First-Order Logic. Log. J. IGPL 6(2): 305-316 (1998) - [c2]Ian M. Hodkinson, Szabolcs Mikulás:
Colorful reducts. RelMiCS 1998: 106-110 - 1997
- [c1]Szabolcs Mikulás:
A note on expressing infinity in cylindrlc-relativised set algebras. RelMiCS 1997: 239-243 - 1995
- [j2]Maarten Marx, Szabolcs Mikulás, István Németi:
Taming Logic. J. Log. Lang. Inf. 4(3): 207-226 (1995) - 1994
- [j1]Hajnal Andréka, Szabolcs Mikulás:
Lambek Calculus and its relational semantics: Completeness and incompleteness. J. Log. Lang. Inf. 3(1): 1-37 (1994)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-21 00:18 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
