I. Németi

发表

Nonstandard runs of Floyd-provable programs

István Németi, I. Németi, 1980, Logic of Programs.

Cylindric Set Algebras

A. Tarski, L. Henkin, J. Monk, 1981 .

Encyclopaedia of Mathematics, Supplement III

Konrad Engel, Willy Govaerts, Francisco Marcellán, 2002 .

TWIN PARADOX AND THE LOGIC FOUNDATION OF SPACE-TIME

I. Németi, J. Madarász, G. Székely, 2005 .

Comparing theories: the dynamics of changing vocabulary. A case-study in relativity theory.

A. Rényi, I. Németi, H. Andréka, 2013 .

An Axiom System for General Relativity Complete with respect to Lorentzian Manifolds

I. Németi, H. Andréka, J. Madarász, 2013, 1310.1475.

Investigations in arrow logic

maarten marx, I. Németi, S. Mikulás, 1997 .

Undecidable Varieties of Semilattice - ordered Semigroups, of Boolean Algebras with Operators, and logics extending Lambek Calculus

András Simon, Ildikó Sain, Ágnes Kurucz, 1993, Log. J. IGPL.

Epimorphisms in cylindric algebras and definability in finite variable logic

S. D. Comer, I. Németi, H. Andréka, 2009 .

Algebras of relations of various ranks , some current trends and applications

I. Németi, H. Andréka, J. Madarász, 2001 .

The generalized completeness of Horn predicate-logic as a programming language

Hajnal Andréka, István Németi, I. Németi, 1978, Acta Cybern..

Completeness of Floyd logic

Hajnal Andréka, István Németi, I. Németi, 1978 .

First-Order Logic Foundation of Relativity Theories

I. Németi, J. Madarász, G. Székely, 2006, gr-qc/0604041.

Twin Paradox and the Logical Foundation of Relativity Theory

I. Németi, J. Madarász, G. Székely, 2005, gr-qc/0504118.

Relativistic computation

I. Németi, H. Andréka, J. Madarász, 2017 .

A Logical Analysis of the Time-Warp Effect of General Relativity

I. Németi, J. Madarász, G. Székely, 2007, 0709.2521.

HSP K is equational class, without the axiom of choice

I. Németi, H. Andréka, 1981 .

Non-Turing Computations Via Malament–Hogarth Space-Times

I. Németi, G. Etesi, 2001, gr-qc/0104023.

Mutual definability does not imply definitional equivalence, a simple example

I. Németi, H. Andréka, J. Madarász, 2005, Math. Log. Q..

Nonstandard Dynamic Logic

István Németi, I. Németi, 1981, Logic of Programs.

Term algebras of elementarily equivalent atom structures

I. Németi, H. Andréka, 2018, Algebra universalis.

Free Boolean algebras with closure operators and a conjecture of Henkin, Monk, and Tarski

I. Németi, J. Madarász, 2001 .

NONREPRESENTABLE RELATION ALGEBRAS FROM GROUPS

S. Givant, I. Németi, H. Andréka, 2020, The Review of Symbolic Logic.

Comparing Theories: The Dynamics of Changing Vocabulary

I. Németi, H. Andréka, 2013, Johan van Benthem on Logic and Information Dynamics.

On the Strength of Temporal Proofs

Ildikó Sain, Hajnal Andréka, István Németi, 1989, Theor. Comput. Sci..

Logic of Space-Time and Relativity Theory

Hajnal Andréka, István Németi, Judit X. Madarász, 2007, Handbook of Spatial Logics.

Relativistic computers and the Turing barrier

István Németi, Gyula Dávid, I. Németi, 2006, Appl. Math. Comput..

Modal Languages and Bounded Fragments of Predicate Logic

Johan van Benthem, Hajnal Andréka, István Németi, 1998, J. Philos. Log..

Back and Forth Between Modal Logic and Classical Logic

Johan van Benthem, Hajnal Andréka, István Németi, 1995, Log. J. IGPL.

ON TARSKI’S AXIOMATIC FOUNDATIONS OF THE CALCULUS OF RELATIONS

Peter Jipsen, Hajnal Andréka, István Németi, 2016, The Journal of Symbolic Logic.

A non representable infinite dimensional quasi-polyadic equality algebra with a representable cylindric reduct

I. Németi, H. Andréka, T. Ahmed, 2013 .

Vienna Circle and Logical Analysis of Relativity Theory

Hajnal Andréka, István Németi, Gergely Székely, 2011, 1101.5894.

A logic road from special relativity to general relativity

Hajnal Andréka, István Németi, Judit X. Madarász, 2010, Synthese.

Weakly higher order cylindric algebras and finite axiomatization of the representables

István Németi, A. Simon, I. Németi, 2009, Stud Logica.

Representability of Pairing Relation Algebras Representability of Pairing Relation Algebras Depends on our Ontology

Ágnes Kurucz, István Németi, Á. Kurucz, 2000 .

On the equational theory of representable polyadic equality algebras

István Németi, Gábor Sági, I. Németi, 2000, Journal of Symbolic Logic.

Notions of Density That Imply Representability in Algebraic Logic

András Simon, Szabolcs Mikulás, Hajnal Andréka, 1998, Ann. Pure Appl. Log..

Decidable and undecidable logics with a binary modality

András Simon, Ildikó Sain, Ágnes Kurucz, 1995, J. Log. Lang. Inf..

Perfect extensions and derived algebras

Hajnal Andréka, István Németi, Steven Givant, 1995, Journal of Symbolic Logic.

Expressibility of properties of relations

Ivo Düntsch, Hajnal Andréka, István Németi, 1995, Journal of Symbolic Logic.

Algebraization of quantifier logics, an introductory overview

István Németi, I. Németi, 1991, Stud Logica.

Splitting in relation algebras

Roger D. Maddux, István Németi, H. Andreka, 1991 .

Weak cylindric set algebras and weak subdirect indecomposability

Hajnal Andréka, István Németi, R. J. Thompson, 1990, Journal of Symbolic Logic.

Decidability of relation algebras with weakened associativity

I. Németi, I. Németi, 1987 .

A non-representable cylindric algebra with pairing functions

I. Németi, 1986 .

Problems with the category theoretic notions of ultraproducts

I. Németi, Hien Huy Bui, 1981 .

A simple, purely algebraic proof of the completeness of some first order logics

Hajnal Andréka, István Németi, I. Németi, 1975 .

Cylindric-like algebras and algebraic logic

I. Németi, H. Andréka, M. Ferenczi, 2013 .

General relativistic hypercomputing and foundation of mathematics

Hajnal Andréka, István Németi, Péter Németi, 2009, Natural Computing.

New Physics and Hypercomputation

Hajnal Andréka, István Németi, I. Németi, 2006, SOFSEM.

A Complete Logic for Reasoning about Programs via Nonstandard Model Theory I

Ildikó Sain, Hajnal Andréka, István Németi, 1982, Theor. Comput. Sci..

Clones of operations on relations

I. Németi, H. Andréka, S. Comer, 1985 .

Using Isabelle/HOL to Verify First-Order Relativity Theory

Mike Stannett, István Németi, I. Németi, 2014, Journal of Automated Reasoning.

Logical Axiomatizations of Space-Time. Samples from the Literature

Hajnal Andréka, István Németi, Judit X. Madarász, 2006 .

Changing a Semantics: Opportunism or Courage?

J. F. A. K. van Benthem, N. Bezhanishvili, J. Benthem, 2014, 1411.7636.

The equational theory of Kleene lattices

Szabolcs Mikulás, Hajnal Andréka, István Németi, 2011, Theor. Comput. Sci..

Finite algebras of relations are representable on finite sets

Ian M. Hodkinson, Hajnal Andréka, István Németi, 1999, Journal of Symbolic Logic.

Closed timelike Curves in relativistic Computation

Hajnal Andréka, István Németi, Gergely Székely, 2011, Parallel Process. Lett..

Visualizing some ideas about Godel-type rotating universes

I. Németi, H. Andréka, A. Andai, 2008, 0811.2910.

Visualizing ideas about Gödel-type rotating universes

I. Németi, H. Andréka, A. Andai, 2009 .

Submodel Preservation Theorems in Finite-Variable Fragments

J.F.A.K. van Benthem, Hajnal Andréka, István Németi, 1995 .

Axiomatizing Relativistic Dynamics without Conservation Postulates

Hajnal Andréka, István Németi, Judit X. Madarász, 2008, Stud Logica.

Can General Relativistic Computers Break the Turing Barrier?

Hajnal Andréka, István Németi, I. Németi, 2006, CiE.

The lattice of varieties of representable relation algebras

Hajnal Andréka, István Németi, Steven Givant, 1994, Journal of Symbolic Logic.

A twist in the geometry of rotating black holes: seeking the cause of acausality

I. Németi, H. Andréka, C. Wüthrich, 2007, 0708.2324.

On cylindric-relativized set algebras

István Németi, I. Németi, H. Andréka, 1981 .

Logical analysis of special relativity theory

I. Németi, H. Andréka, J. Madarász, 1999 .

Reducing first-order logic to Df 3 , free algebras . Hajnal Andréka and István Németi

I. Németi, 2015 .

Axiomatization of identity-free equations valid in relation algebras

I. Németi, H. Andréka, 1996 .

On Neat Reducts of Algebras of Logic

Tarek Sayed Ahmed, István Németi, I. Németi, 2001, Stud Logica.

Cylindric-relativised set algebras have strong amalgamation

István Németi, I. Németi, 1985, Journal of Symbolic Logic.

On varieties of cylindric algebras with applications to logic

István Németi, I. Németi, 1987, Ann. Pure Appl. Log..

On cylindric algebraic model theory

István Németi, I. Németi, 1990, Algebraic Logic and Universal Algebra in Computer Science.

On universal algebraic constructions of logics

T. Gergely, Hajnal Andréka, István Németi, 1977 .

TWO-VARIABLE LOGIC HAS WEAK, BUT NOT STRONG, BETH DEFINABILITY

Hajnal Andréka, István Németi, I. Németi, 2020, The Journal of Symbolic Logic.

Omitting types for finite variable fragments and complete representations of algebras

Tarek Sayed Ahmed, Hajnal Andréka, István Németi, 2008, Journal of Symbolic Logic.

Dimension-complemented and locally finite dimensional cylindric algebras are elementarily equivalent

Hajnal Andréka, István Németi, I. Németi, 1981 .

On systems of varieties definable by schemes of equations

Hajnal Andréka, István Németi, I. Németi, 1980 .

On the number of generators of cylindric algebras

Hajnal Andréka, István Németi, I. Németi, 1985, Journal of Symbolic Logic.

Dynamic Algebras of Programs

István Németi, I. Németi, 1981, FCT.

Some Universal Algebraic and Model Theoretic Results in Computer Science

Hajnal Andréka, István Németi, I. Németi, 1981, FCT.

ON THE NUMBER OF GENERATORS OF

István Németi, Cylindric Algebras, H. Andreka, 2016 .

On universal algebraic logic and cylindric algebras

I. Németi, H. Andréka, 1978 .

The Class of Neat-Reducts of Cylindric Algebras is Not a Variety But is Closed w.r.t. HP

I. Németi, 2003 .

Faster than light motion does not imply time travel

I. Németi, H. Andréka, J. Madarász, 2014, 1407.2528.

A system of logic for partial functions under existence-dependent kleene equality

William Craig, Hajnal Andréka, István Németi, 1988, Journal of Symbolic Logic.