István Németi - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 75 from 75

2023

No Faster-Than-Light Observers (GenRel)Mike Stannett, Edward Higgins, Hajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely. afp, 2023, 2023. [doi]

2022

Complexity in the interdefinability of timelike, lightlike and spacelike relatedness of Minkowski spacetimeHajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely. APAL, 173(5):103100, 2022. [doi]

2021

Two-variable Logic has Weak, but not Strong, Beth DefinabilityHajnal Andréka, István Németi. JSYML, 86(2):785-800, 2021. [doi]

2020

Nonrepresentable Relation Algebras from GroupsHajnal Andréka, István Németi, Steven Givant. rsl, 13(4):861-881, 2020. [doi]

2019

Nonrepresentable Relation Algebras from Groups - addendumHajnal Andréka, István Németi, Steven Givant. rsl, 12(4):892, 2019. [doi]

2017

On Tarski's Axiomatic Foundations of the Calculus of RelationsHajnal Andréka, Steven Givant, Peter Jipsen, István Németi. JSYML, 82(3):966-994, 2017. [doi]

On A New Semantics for First-Order Predicate LogicHajnal Andréka, Johan van Benthem, István Németi. jphil, 46(3):259-267, 2017. [doi]

2016

No Faster-Than-Light ObserversMike Stannett, István Németi. afp, 2016, 2016. [doi]

2014

Comparing Theories: The Dynamics of Changing VocabularyHajnal Andréka, István Németi. In Alexandru Baltag, Sonja Smets, editors, Johan van Benthem on Logic and Information Dynamics. pages 143-172, Springer, 2014. [doi]

Using Isabelle/HOL to Verify First-Order Relativity TheoryMike Stannett, István Németi. JAR, 52(4):361-378, 2014. [doi]

2012

2011

The equational theory of Kleene latticesHajnal Andréka, Szabolcs Mikulás, István Németi. TCS, 412(52):7099-7108, 2011. [doi]

2008

Omitting types for finite variable fragments and complete representations of algebrasTarek Sayed Ahmed, Hajnal Andréka, István Németi. JSYML, 73(1):65-89, 2008. [doi]

Axiomatizing Relativistic Dynamics without Conservation PostulatesHajnal Andréka, Judit X. Madarász, István Németi, Gergely Székely. sLogica, 89(2):163-186, 2008. [doi]

2006

New Physics and HypercomputationIstván Németi, Hajnal Andréka. sofsem 2006: 63-63 [doi]

Can General Relativistic Computers Break the Turing Barrier?István Németi, Hajnal Andréka. cie 2006: 398-412 [doi]

Relativistic computers and the Turing barrierIstván Németi, Gyula Dávid. amc, 178(1):118-142, 2006. [doi]

2005

Mutual definability does not imply definitional equivalence, a simple exampleHajnal Andréka, Judit X. Madarász, István Németi. mlq, 51(6):591-597, 2005. [doi]

2001

On Neat Reducts of Algebras of LogicTarek Sayed Ahmed, István Németi. sLogica, 68(2):229-262, 2001.

2000

On The Equational Theory of Representable Polyadic Equality AlgebrasIstván Németi, Gábor Sági. JSYML, 65(3):1143-1167, 2000.

Representability of Pairing Relation Algebras Depends on your OntologyÁgnes Kurucz, István Németi. FUIN, 44(4):397-420, 2000.

1999

Finite Algebras of Relations Are Representable on Finite SetsHajnal Andréka, Ian M. Hodkinson, István Németi. JSYML, 64(1):243-267, 1999.

1998

1997

The finite base property for some cylindric-relativized algebras (Abstract)Hajnal Andréka, Ian M. Hodkinson, István Németi. RelMiCS 1997: 81

Decision problems for equational theories of relation algebrasHajnal Andréka, Steven Givant, István Németi. Volume 126 of Memoirs of the American Mathematical Society, American Mathematical Society, 1997.

Relation Algebras from Cylindric and Polyadic AlgebrasIstván Németi, András Simon. igpl, 5(4):575-588, 1997. [doi]

Strong Representability of Fork Algebras, a Set Theoretic FoundationIstván Németi. igpl, 5(1):3-23, 1997. [doi]

1995

Binary Relations and Permutation GroupsHajnal Andréka, Ivo Düntsch, István Németi. mlq, 41:197-216, 1995.

Expressibility of Properties of RelationsHajnal Andréka, Ivo Düntsch, István Németi. JSYML, 60(3):970-991, 1995.

Perfect Extensions and Derived AlgebrasHajnal Andréka, Steven Givant, István Németi. JSYML, 60(3):775-796, 1995.

Back and Forth Between Modal Logic and Classical LogicHajnal Andréka, Johan van Benthem, István Németi. igpl, 3(5):685-720, 1995. [doi]

Taming LogicMaarten Marx, Szabolcs Mikulás, István Németi. jolli, 4(3):207-226, 1995.

Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with OperatorsIstván Németi, Ildikó Sain, András Simon. igpl, 3(1):93-105, 1995. [doi]

Decidable and Undecidable Logics with a Binary ModalityÁgnes Kurucz, István Németi, Ildikó Sain, András Simon. jolli, 4(3):191-206, 1995.

1994

Connections Between Axioms of Set Theory and Basic Theorems of Universal AlgebraHajnal Andréka, Ágnes Kurucz, István Németi. JSYML, 59(3):912-923, 1994.

The Lattice of Varieties of Representable Relation AlgebrasHajnal Andréka, Steven Givant, István Németi. JSYML, 59(2):631-661, 1994.

1993

Applying Algebraic Logic to LogicHajnal Andréka, István Németi, Ildikó Sain. amast 1994: 5-26

Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek CalculusÁgnes Kurucz, István Németi, Ildikó Sain, András Simon. igpl, 1(1):91-98, 1993. [doi]

1991

On the Strength of Temporal ProofsHajnal Andréka, István Németi, Ildikó Sain. TCS, 80(2):125-151, 1991.

Algebraization of quantifier logics, an introductory overviewIstván Németi. sLogica, 50(3-4):485-569, 1991. [doi]

1990

Weak Cylindric Set Algebra and Weak Subdirect IndecomposabilityHajnal Andréka, István Németi, R. J. Thompson. JSYML, 55(2):577-588, 1990.

1989

Algebraic Logic ConferenceHajnal Andréka, M. Ferenczi, István Németi, György Serény. JSYML, 54(2):686, 1989.

On the Strength of Temporal ProofsHajnal Andréka, István Németi, Ildikó Sain. mfcs 1989: 135-144

1988

Relatively free relation algebrasHajnal Andréka, Bjarni Jónsson, István Németi. aluacs 1990: 1-14

A System of Logic for Partial Functions Under Existence-Dependent Kleene EqualityHajnal Andréka, William Craig, István Németi. JSYML, 53(3):834-839, 1988.

On cylindric algebraic model theoryIstván Németi. aluacs 1990: 37-75

1987

A Unifying Theorem for Algebraic Semantics and Dynamic LogicsHajnal Andréka, Irène Guessarian, István Németi. iandc, 72(1):31-45, January 1987.

On varieties of cylindric algebras with applications to logicIstván Németi. APAL, 36:235-277, 1987. [doi]

1986

Logic and Computation (Panel)István Németi. ifip 1986: 395-396

1985

A unifying theorem for algebraic semantics and dynamic logicsHajnal Andréka, Irène Guessarian, István Németi. fct 1985: 8-17

On the Number of Generators of Cylindric AlgebrasHajnal Andréka, István Németi. JSYML, 50(4):865-873, 1985.

Cylindric-Relativised Set Algebras have Strong AmalgamationIstván Németi. JSYML, 50(3):689-700, 1985.

1983

The class of neat-reducts of cylindric algebras is not a variety but is closed with respect to HPIstván Németi. ndjfl, 24(3):399-409, 1983. [doi]

1982

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory IHajnal Andréka, István Németi, Ildikó Sain. TCS, 17:193-212, 1982.

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory IIHajnal Andréka, István Németi, Ildikó Sain. TCS, 17:259-278, 1982.

Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and RepresentableIstván Németi. TCS, 17:343-347, 1982.

1981

A Characterization of Floyd-Provable ProgramsHajnal Andréka, István Németi, Ildikó Sain. mfcs 1981: 162-171

Some Universal Algebraic and Model Theoretic Results in Computer ScienceHajnal Andréka, István Németi. fct 1981: 16-23

Nonstandard Dynamic LogicIstván Németi. lop 1982: 311-348

Dynamic Algebras of ProgramsIstván Németi. fct 1981: 281-290

1980

The generalized completeness of Horn predicate-logic as a programming languageHajnal Andréka, István Németi. actaC, 4:3-10, 1980.

Model Theoretic Semantics For Many-Purpose Languages And Language HierarchiesHajnal Andréka, Tamás Gergely, István Németi. COLING 1980: 213-219 [doi]

Nonstandard runs of Floyd-provable programsIstván Németi. lop 1983: 186-204

1979

Completeness Problems in Verification of Programs and Program SchemesHajnal Andréka, István Németi, Ildikó Sain. mfcs 1979: 208-218

Henkin-type semantics for program-schemes to turn negative results to positiveHajnal Andréka, István Németi, Ildikó Sain. fct 1979: 18-24

1976

Notes on maximal congruence relations, automata and related topicsHajnal Andréka, Sándor Horváth, István Németi. actaC, 2:71-88, 1976.

Logical foundations for a general theory of systemsTamás Gergely, István Németi. actaC, 2:261-276, 1976.

1975

On the Role of Mathematical Language Concept in the Theory of Intelligent SystemsHajnal Andréka, Tamás Gergely, István Németi. IJCAI 1975: 9-14

Definition Theory as Basis for a Creative Problem SolverT. Gorgely, Hajnal Andréka, István Németi. IJCAI 1975: 40-45

Sign in or sign up to see more results.

runs on WebDSL