default search action
István Németi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j55]Mike Stannett, Edward Higgins, Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely:
No Faster-Than-Light Observers (GenRel). Arch. Formal Proofs 2023 (2023) - 2022
- [j54]Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely
:
Complexity in the interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetime. Ann. Pure Appl. Log. 173(5): 103100 (2022) - 2021
- [j53]Hajnal Andréka, István Németi:
Two-variable Logic has Weak, but not Strong, Beth Definability. J. Symb. Log. 86(2): 785-800 (2021) - 2020
- [j52]Hajnal Andréka, István Németi, Steven Givant:
Nonrepresentable Relation Algebras from Groups. Rev. Symb. Log. 13(4): 861-881 (2020)
2010 – 2019
- 2019
- [j51]Hajnal Andréka, István Németi, Steven Givant:
Nonrepresentable Relation Algebras from Groups - addendum. Rev. Symb. Log. 12(4): 892 (2019) - 2017
- [j50]Hajnal Andréka, Johan van Benthem, István Németi:
On A New Semantics for First-Order Predicate Logic. J. Philos. Log. 46(3): 259-267 (2017) - [j49]Hajnal Andréka, Steven Givant, Peter Jipsen
On Tarski's Axiomatic Foundations of the Calculus of Relations. J. Symb. Log. 82(3): 966-994 (2017) - 2016
- [j48]Mike Stannett, István Németi:
No Faster-Than-Light Observers. Arch. Formal Proofs 2016 (2016) - 2014
- [j47]Mike Stannett
Using Isabelle/HOL to Verify First-Order Relativity Theory. J. Autom. Reason. 52(4): 361-378 (2014) - [p2]Hajnal Andréka, István Németi:
Comparing Theories: The Dynamics of Changing Vocabulary. Johan van Benthem on Logic and Information Dynamics 2014: 143-172 - 2012
- [j46]Hajnal Andréka, Judit X. Madarász, István Németi:
Decidability, Undecidability, and Gödel's Incompleteness in Relativity Theories. Parallel Process. Lett. 22(3) (2012) - [j45]Hajnal Andréka, István Németi, Gergely Székely
Closed timelike Curves in relativistic Computation. Parallel Process. Lett. 22(3) (2012) - [j44]Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely
A logic road from special relativity to general relativity. Synth. 186(3): 633-649 (2012) - [c20]Hajnal Andréka, Szabolcs Mikulás, István Németi:
Residuated Kleene Algebras. Logic and Program Semantics 2012: 1-11 - [i1]Mike Stannett
Using Isabelle to verify special relativity, with application to hypercomputation theory. CoRR abs/1211.6468 (2012) - 2011
- [j43]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
- [j42]Hajnal Andréka, István Németi, Péter Németi:
General relativistic hypercomputing and foundation of mathematics. Nat. Comput. 8(3): 499-516 (2009) - [j41]István Németi, András Simon:
Weakly higher order cylindric algebras and finite axiomatization of the representables. Stud Logica 91(1): 53-62 (2009) - 2008
- [j40]Tarek Sayed Ahmed, Hajnal Andréka, István Németi:
Omitting types for finite variable fragments and complete representations of algebras. J. Symb. Log. 73(1): 65-89 (2008) - [j39]Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely
Axiomatizing Relativistic Dynamics without Conservation Postulates. Stud Logica 89(2): 163-186 (2008) - 2007
- [p1]Hajnal Andréka, Judit X. Madarász, István Németi:
Logic of Space-Time and Relativity Theory. Handbook of Spatial Logics 2007: 607-711 - 2006
- [j38]István Németi, Gyula Dávid:
Relativistic computers and the Turing barrier. Appl. Math. Comput. 178(1): 118-142 (2006) - [c19]István Németi, Hajnal Andréka:
Can General Relativistic Computers Break the Turing Barrier?. CiE 2006: 398-412 - [c18]István Németi, Hajnal Andréka:
New Physics and Hypercomputation. SOFSEM 2006: 63-63 - 2005
- [j37]Hajnal Andréka, Judit X. Madarász, István Németi:
Mutual definability does not imply definitional equivalence, a simple example. Math. Log. Q. 51(6): 591-597 (2005) - 2001
- [j36]Tarek Sayed Ahmed, István Németi:
On Neat Reducts of Algebras of Logic. Stud Logica 68(2): 229-262 (2001) - 2000
- [j35]Ágnes Kurucz, István Németi:
Representability of Pairing Relation Algebras Depends on your Ontology. Fundam. Informaticae 44(4): 397-420 (2000) - [j34]István Németi, Gábor Sági:
On The Equational Theory of Representable Polyadic Equality Algebras. J. Symb. Log. 65(3): 1143-1167 (2000)
1990 – 1999
- 1999
- [j33]Hajnal Andréka, Ian M. Hodkinson
Finite Algebras of Relations Are Representable on Finite Sets. J. Symb. Log. 64(1): 243-267 (1999) - 1998
- [j32]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) - [j31]István Németi, Gábor Sági:
On the Equational Theory of Representable Polyadic Equality Algebras. Log. J. IGPL 6(1): 3-15 (1998) - [j30]Hajnal Andréka, István Németi, Johan van Benthem:
Modal Languages and Bounded Fragments of Predicate Logic. J. Philos. Log. 27(3): 217-274 (1998) - [j29]Hajnal Andréka, Robert Goldblatt
Relativised Quantification: Some Canonical Varieties of Sequence-Set Algebras. J. Symb. Log. 63(1): 163-184 (1998) - 1997
- [b1]Hajnal Andréka, Steven Givant, István Németi:
Decision problems for equational theories of relation algebras. Memoirs of the American Mathematical Society 126, American Mathematical Society 1997, ISBN 978-0-8218-0595-4, pp. I-XIV, 1-126 - [j28]István Németi:
Strong Representability of Fork Algebras, a Set Theoretic Foundation. Log. J. IGPL 5(1): 3-23 (1997) - [j27]István Németi, András Simon:
Relation Algebras from Cylindric and Polyadic Algebras. Log. J. IGPL 5(4): 575-588 (1997) - [c17]Hajnal Andréka, Ian M. Hodkinson, István Németi:
The finite base property for some cylindric-relativized algebras (Abstract). RelMiCS 1997: 81 - 1995
- [j26]István Németi, Ildikó Sain, András Simon:
Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators. Log. J. IGPL 3(1): 93-105 (1995) - [j25]Hajnal Andréka, Johan van Benthem, István Németi:
Back and Forth Between Modal Logic and Classical Logic. Log. J. IGPL 3(5): 685-720 (1995) - [j24]Ágnes Kurucz, István Németi, Ildikó Sain, András Simon:
Decidable and Undecidable Logics with a Binary Modality. J. Log. Lang. Inf. 4(3): 191-206 (1995) - [j23]Maarten Marx
Taming Logic. J. Log. Lang. Inf. 4(3): 207-226 (1995) - [j22]Hajnal Andréka, Steven Givant, István Németi:
Perfect Extensions and Derived Algebras. J. Symb. Log. 60(3): 775-796 (1995) - [j21]Hajnal Andréka, Ivo Düntsch
Expressibility of Properties of Relations. J. Symb. Log. 60(3): 970-991 (1995) - [j20]Hajnal Andréka, Ivo Düntsch
Binary Relations and Permutation Groups. Math. Log. Q. 41: 197-216 (1995) - 1994
- [j19]Hajnal Andréka, Steven Givant, István Németi:
The Lattice of Varieties of Representable Relation Algebras. J. Symb. Log. 59(2): 631-661 (1994) - [j18]Hajnal Andréka, Ágnes Kurucz, István Németi:
Connections Between Axioms of Set Theory and Basic Theorems of Universal Algebra. J. Symb. Log. 59(3): 912-923 (1994) - 1993
- [j17]Ágnes Kurucz, István Németi, Ildikó Sain, András Simon:
Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus. Log. J. IGPL 1(1): 91-98 (1993) - [c16]Hajnal Andréka, István Németi, Ildikó Sain:
Applying Algebraic Logic to Logic. AMAST 1993: 5-26 - 1991
- [j16]István Németi:
Algebraization of quantifier logics, an introductory overview. Stud Logica 50(3-4): 485-569 (1991) - [j15]Hajnal Andréka, István Németi, Ildikó Sain:
On the Strength of Temporal Proofs. Theor. Comput. Sci. 80(2): 125-151 (1991) - 1990
- [j14]Hajnal Andréka, István Németi, R. J. Thompson:
Weak Cylindric Set Algebra and Weak Subdirect Indecomposability. J. Symb. Log. 55(2): 577-588 (1990)
1980 – 1989
- 1989
- [j13]Hajnal Andréka, Miklós Ferenczi, István Németi, György Serény:
Algebraic Logic Conference. J. Symb. Log. 54(2): 686 (1989) - [c15]Hajnal Andréka, István Németi, Ildikó Sain:
On the Strength of Temporal Proofs. MFCS 1989: 135-144 - 1988
- [j12]Hajnal Andréka, William Craig, István Németi:
A System of Logic for Partial Functions Under Existence-Dependent Kleene Equality. J. Symb. Log. 53(3): 834-839 (1988) - [c14]Hajnal Andréka, Bjarni Jónsson, István Németi:
Relatively free relation algebras. Algebraic Logic and Universal Algebra in Computer Science 1988: 1-14 - [c13]István Németi:
On cylindric algebraic model theory. Algebraic Logic and Universal Algebra in Computer Science 1988: 37-75 - 1987
- [j11]István Németi:
On varieties of cylindric algebras with applications to logic. Ann. Pure Appl. Log. 36: 235-277 (1987) - [j10]Hajnal Andréka, Irène Guessarian, István Németi:
A Unifying Theorem for Algebraic Semantics and Dynamic Logics. Inf. Comput. 72(1): 31-45 (1987) - 1986
- [c12]István Németi:
Logic and Computation (Panel). IFIP Congress 1986: 395-396 - 1985
- [j9]István Németi:
Cylindric-Relativised Set Algebras have Strong Amalgamation. J. Symb. Log. 50(3): 689-700 (1985) - [j8]Hajnal Andréka, István Németi:
On the Number of Generators of Cylindric Algebras. J. Symb. Log. 50(4): 865-873 (1985) - [c11]Hajnal Andréka, Irène Guessarian, István Németi:
A unifying theorem for algebraic semantics and dynamic logics. FCT 1985: 8-17 - 1983
- [j7]István Németi:
The class of neat-reducts of cylindric algebras is not a variety but is closed with respect to HP. Notre Dame J. Formal Log. 24(3): 399-409 (1983) - 1982
- [j6]Hajnal Andréka, István Németi, Ildikó Sain:
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I. Theor. Comput. Sci. 17: 193-212 (1982) - [j5]Hajnal Andréka, István Németi, Ildikó Sain:
A Complete Logic for Reasoning about Programs via Nonstandard Model Theory II. Theor. Comput. Sci. 17: 259-278 (1982) - [j4]István Németi:
Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable. Theor. Comput. Sci. 17: 343-347 (1982) - 1981
- [c10]Hajnal Andréka, István Németi:
Some Universal Algebraic and Model Theoretic Results in Computer Science. FCT 1981: 16-23 - [c9]István Németi:
Dynamic Algebras of Programs. FCT 1981: 281-290 - [c8]István Németi:
Nonstandard Dynamic Logic. Logic of Programs 1981: 311-348 - [c7]Hajnal Andréka, István Németi, Ildikó Sain:
A Characterization of Floyd-Provable Programs. MFCS 1981: 162-171 - 1980
- [c6]Hajnal Andréka, Tamás Gergely, István Németi:
Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies. COLING 1980: 213-219 - [c5]István Németi:
Nonstandard runs of Floyd-provable programs. Logic of Programs 1980: 186-204
1970 – 1979
- 1979
- [c4]Hajnal Andréka, István Németi, Ildikó Sain:
Henkin-type semantics for program-schemes to turn negative results to positive. FCT 1979: 18-24 - [c3]Hajnal Andréka, István Németi, Ildikó Sain:
Completeness Problems in Verification of Programs and Program Schemes. MFCS 1979: 208-218 - 1978
- [j3]Hajnal Andréka, István Németi:
The generalized completeness of Horn predicate-logic as a programming language. Acta Cybern. 4(1): 3-10 (1978) - 1975
- [j2]Tamás Gergely, István Németi:
Logical foundations for a general theory of systems. Acta Cybern. 2(3): 261-276 (1975) - [c2]Hajnal Andréka, Tamás Gergely, István Németi:
On the Role of Mathematical Language Concept in the Theory of Intelligent Systems. IJCAI 1975: 9-14 - [c1]T. Gorgely, Hajnal Andréka, István Németi:
Definition Theory as Basis for a Creative Problem Solver. IJCAI 1975: 40-45 - 1973
- [j1]Hajnal Andréka, Sándor Horváth, István Németi:
Notes on maximal congruence relations, automata and related topics. Acta Cybern. 2(1): 71-88 (1973)
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 2024-10-07 22:23 CEST 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: