István Németi

发表

On the Strength of Temporal Proofs

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

The equational theory of Kleene lattices

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

Axiomatizing Relativistic Dynamics without Conservation Postulates

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

Decidable and undecidable logics with a binary modality

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

Relativistic computers and the Turing barrier

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

Notions of Density That Imply Representability in Algebraic Logic

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

Model Theoretic Semantics For Many-Purpose Languages And Language Hierarchies

Tamás Gergely, Hajnal Andréka, István Németi, 1980, COLING.

On varieties of cylindric algebras with applications to logic

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

Some new landmarks on the roadmap of two dimensional logics

Ildikó Sain, Hajnal Andréka, István Németi, 1994 .

Representability of Pairing Relation Algebras Depends on your Ontology

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

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.

A unifying theorem for algebraic semantics and dynamic logics

Irène Guessarian, Hajnal Andréka, István Németi, 1985, FCT.

Undecidability of the Equational Theory of Some Classes of Residuated Boolean Algebras with Operators

András Simon, Ildikó Sain, István Németi, 1995, Log. J. IGPL.

Perfect extensions and derived algebras

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

Cylindric-relativised set algebras have strong amalgamation

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

A Unifying Theorem for Algebraic Semantics and Dynamic Logics

Irène Guessarian, Hajnal Andréka, István Németi, 1987, Inf. Comput..

On the Role of Mathematical Language Concept in the Theory of Intelligent Systems

Tamás Gergely, Hajnal Andréka, István Németi, 1975, IJCAI.

A logic road from special relativity to general relativity

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

No Faster-Than-Light Observers

Mike Stannett, István Németi, 2016, Arch. Formal Proofs.

Expressibility of properties of relations

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

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.

Problem-oriented language hierarchy and the engagement of logic.

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

Binary Relations and Permutation Groups

Ivo Düntsch, Hajnal Andréka, István Németi, 1995, Math. Log. Q..

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..

Algebraization of quantifier logics, an introductory overview

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

A Characterization of Floyd-Provable Programs

Ildikó Sain, Hajnal Andréka, István Németi, 1981, MFCS.

Completeness Problems in Verification of Programs and Program Schemes

Ildikó Sain, Hajnal Andréka, István Németi, 1979, MFCS.

Closed timelike Curves in relativistic Computation

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

Using Isabelle/HOL to Verify First-Order Relativity Theory

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

Completeness of Floyd logic

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

Algebraic Logic Conference

György Serény, Hajnal Andréka, István Németi, 1989, J. Symb. Log..

Can General Relativistic Computers Break the Turing Barrier?

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

Weakly higher order cylindric algebras and finite axiomatization of the representables

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

Decidability, Undecidability, and Gödel's Incompleteness in Relativity Theories

Hajnal Andréka, István Németi, Judit X. Madarász, 2012, Parallel Process. Lett..

Some Universal Algebraic and Model Theoretic Results in Computer Science

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

Nonstandard runs of Floyd-provable programs

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

Henkin-type semantics for program-schemes to turn negative results to positive

Ildikó Sain, Hajnal Andréka, István Németi, 1979, FCT.

Effective temporal logics of programs

Szabolcs Mikulás, Ildikó Sain, Hajnal Andréka, 1995 .

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 II

Ildikó Sain, Hajnal Andréka, István Németi, 1982, 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.

Strong Representability of Fork Algebras, a Set Theoretic Foundation

István Németi, 1997, Log. J. IGPL.

On cylindric algebraic model theory

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

Logical Axiomatizations of Space-Time. Samples from the Literature

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

Logic of Space-Time and Relativity Theory

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

Relation Algebras from Cylindric and Polyadic Algebras

András Simon, István Németi, 1997, Log. J. IGPL.

Decision problems for equational theories of relation algebras

Hajnal Andréka, István Németi, Steven Givant, 1997, Memoirs of the American Mathematical Society.

The class of neat-reducts of cylindric algebras is not a variety but is closed with respect to HP

István Németi, 1983, Notre Dame J. Formal Log..

On the number of generators of cylindric algebras

Hajnal Andréka, István Németi, I. Németi, 1985, 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.

General relativistic hypercomputing and foundation of mathematics

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

Dynamic Algebras of Programs

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

Nonstandard Dynamic Logic

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

Taming logic

Maarten Marx, Szabolcs Mikulás, István Németi, 1995, J. Log. Lang. Inf..

The finite base property for some cylindric-relativized algebras (Abstract)

Ian M. Hodkinson, Hajnal Andréka, István Németi, 1997, RelMiCS.

Relatively free relation algebras

Hajnal Andréka, István Németi, Bjarni Jónsson, 1988, Algebraic Logic and Universal Algebra in Computer Science.

General algebraic logic: a perspective on “what is logic”

Hajnal Andréka, István Németi, 1994 .

Applying Algebraic Logic to Logic

Ildikó Sain, Hajnal Andréka, István Németi, 1993, AMAST.

ON THE NUMBER OF GENERATORS OF

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

Notes on maximal congruence relations, automata and related topics

Hajnal Andréka, István Németi, Sándor Horváth, 1973, Acta Cybern..

Logic and Computation (Panel)

István Németi, 1986, IFIP Congress.

Relativised Quantification: Some Canonical Varieties of Sequence-Set Algebras

Robert Goldblatt, Hajnal Andréka, István Németi, 1998, J. Symb. Log..

Program verification within and without logic

Ildikó Sain, Hajnal Andréka, István Németi, 1979 .

Weak cylindric set algebras and weak subdirect indecomposability

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

On Neat Reducts of Algebras of Logic

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

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.

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

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

A System of Logic for Partial Functions Under Existence-Dependent Kleene Equality

William Craig, Hajnal Andréka, István Németi, 1988, J. Symb. Log..

On the Strength of Temporal Proofs

Ildikó Sain, Hajnal Andréka, István Németi, 1989, MFCS.

On A New Semantics for First-Order Predicate Logic

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

Logical foundations for a general theory of systems

Tamás Gergely, István Németi, 1975, Acta Cybern..

Nonrepresentable Relation Algebras from Groups - addendum

Hajnal Andréka, István Németi, Steven Givant, 2019, Rev. Symb. Log..

Review: Alfred Tarski, Steven Givant, A Formalization of Set Theory Without Variables

István Németi, 1990 .

The lattice of varieties of representable relation algebras

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

Definition Theory as Basis for a Creative Problem Solver

Hajnal Andréka, István Németi, T. Gorgely, 1975, IJCAI.

Residuated Kleene Algebras

Szabolcs Mikulás, Hajnal Andréka, István Németi, 2012, Logic and Program Semantics.

Modal Languages and Bounded Fragments of Predicate Logic

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

Every Free Algebra in the Variety Generated by the Representable Dynamic Algebras is Separable and Representable

István Németi, 1982, Theor. Comput. Sci..

Connections Between Axioms of Set Theory and Basic Theorems of Universal Algebra

Ágnes Kurucz, Hajnal Andréka, István Németi, 1994, J. Symb. Log..

Back and Forth Between Modal Logic and Classical Logic

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

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.

FORK ALGEBRAS IN USUAL AND IN NON-WELL-FOUNDED SET THEORIES1

Ildikó Sain, István Németi, 2007 .

Formulas and ultraproducts in categories

István Németi, Hajnalka Andréka, 1979 .

Decidable Logics of the Dynamic Trend, and Relativized Relation Algebras

Szabolcs Mikulás, Ildikó Sain, István Németi, 1995 .

Generalization of the concept of variety and quasivariety to partial algebras through category theory

Hajnal Andréka, István Németi, 1983 .

A fine-structure analysis of first-order logic

István Németi, 1997 .

On the equational theory of representable polyadic equality algebras

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

On generalizing the logic-approach to space-time towards general relativity: first steps

István Németi, Judit X. Madarász, Csaba Toke, 2004 .

On systems of varieties definable by schemes of equations

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

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

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

Twin Paradox and the Logical Foundation of Relativity Theory

István Németi, Judit X. Madarász, Gergely Székely, 2006 .

Splitting in relation algebras

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

Submodel Preservation Theorems in Finite-Variable Fragments

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

0 Fe b 20 02 Non-Turing computations via Malament – Hogarth spacetimes

István Németi, Gábor Etesi, 2002 .

Free algebras in discriminator varieties

Hajnal Andréka, István Németi, Bjarni Jónsson, 1991 .

Tarski Alfred and Givant Steven. A formalization of set theory without variables . American Mathematical Society colloquium publications, vol. 41. American Mathematical Society, Providence 1987, xxi + 318 pp.

István Németi, 1990 .

A nonpermutational integral relation algebra.

Ivo Düntsch, Hajnal Andréka, István Németi, 1992 .

INJECTIVITY IN CATEGORIES TO REPRESENT ALL FIRST ORDER FORMULAS, I

Hajnal Andréka, István Németi, 1979 .

Non-Turing Computations Via Malament–Hogarth Space-Times

István Németi, Gábor Etesi, 2001 .

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

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

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

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

On cylindric-relativized set algebras

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

On universal algebraic constructions of logics

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

Vienna Circle and Logical Analysis of Relativity Theory

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