István Németi | Renyi Institute of Mathematics (original) (raw)

Uploads

On a proof of Shelah by István Németi

Research paper thumbnail of Residuated kleene algebras

Research paper thumbnail of Mutual definability does not imply definitional equivalence, a simple example

Research paper thumbnail of Modal Languages and Bounded Fragments of Predicate Logic

Journal of Philosophical Logic, 1998

Research paper thumbnail of Visualizing some ideas about Godel-type rotating universes

Research paper thumbnail of Epimorphisms in cylindric algebras and definability in finite variable logic

Algebra universalis, 2009

Research paper thumbnail of On a proof of Shelah

Papers by István Németi

Research paper thumbnail of Problems with the category theoretic notions of ultraproducts

Bulletin of the Section of Logic, 1981

In this paper we try to initiate a search for an explicite and direct definition of ultraproducts... more In this paper we try to initiate a search for an explicite and direct definition of ultraproducts in categories which would share some of the attractive properties of products, coproducts, limits, and related category theoretic notions. Consider products as a motivating example. ...

Research paper thumbnail of Vienna Circle and Logical Analysis of Relativity Theory

In this paper we present some of our school's results in the area of building up relativity t... more In this paper we present some of our school's results in the area of building up relativity theory (RT) as a hierarchy of theories in the sense of logic. We use plain first-order logic (FOL) as in the foundation of mathematics (FOM) and we build on experience gained in FOM. The main aims of our school are the following: We

Research paper thumbnail of Closed Timelike Curves in Relativistic Computation

In this paper, we investigate the possibility of using closed timelike curves (CTCs) in relativis... more In this paper, we investigate the possibility of using closed timelike curves (CTCs) in relativistic hypercomputation. We introduce a wormhole based hypercomputation scenario which is free from the common worries, such as the blueshift problem. We also discuss the physical reasonability of our scenario, and why we cannot simply ignore the possibility of the existence of spacetimes containing CTCs.

Research paper thumbnail of On Logical Analysis of Relativity Theories

The aim of this paper is to give an introduction to our axiomatic logical analysis of relativity ... more The aim of this paper is to give an introduction to our axiomatic logical analysis of relativity theories.

Research paper thumbnail of Endoftime

This is Part I of the presentation of a talk given on September 27, 2013 at the Logic and Philoso... more This is Part I of the presentation of a talk given on September 27, 2013 at the Logic and Philosophy of Mathematics seminar of ELTE University, Budapest. We present a concrete mathematical realization for the Leibnizian relationist concept of time and space, via a logical analysis of exploring time and space experimentally. We start out from ideas in James Ax’s 1978 paper entitled “The elementary foundations of spacetime”.

Research paper thumbnail of Finite-variable logics do not have weak Beth definability property

We prove that n-variable logics do not have the weak Beth definability property, for all n greate... more We prove that n-variable logics do not have the weak Beth definability property, for all n greater than 2. This was known for n=3 (Ildik\'o Sain and Andr\'as Simon), and for n greater than 4 (Ian Hodkinson). Neither of the previous proofs works for n=4. In this paper we settle the case of n=4, and we give a uniform, simpler proof for all n greater than 2. The case for n=2 is still open.

Research paper thumbnail of Finite-Variable Logics Do Not Have Weak Beth Definability Property

Studies in Universal Logic, 2015

Research paper thumbnail of Completeness problems in verification of programs and program schemes

Lecture Notes in Computer Science, 1979

Research paper thumbnail of Changing a Semantics: Opportunism or Courage?

Studies in Universal Logic, 2014

Research paper thumbnail of Taming logic

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

Studia Scientiarum Mathematicarum Hungarica, 2001

Research paper thumbnail of A non representable infinite dimensional quasi-polyadic equality algebra with a representable cylindric reduct

Studia Scientiarum Mathematicarum Hungarica, 2013

Research paper thumbnail of Can new physics challenge “old” computational barriers?

Research paper thumbnail of Applied Logic Conference

Research paper thumbnail of Residuated kleene algebras

Research paper thumbnail of Mutual definability does not imply definitional equivalence, a simple example

Research paper thumbnail of Modal Languages and Bounded Fragments of Predicate Logic

Journal of Philosophical Logic, 1998

Research paper thumbnail of Visualizing some ideas about Godel-type rotating universes

Research paper thumbnail of Epimorphisms in cylindric algebras and definability in finite variable logic

Algebra universalis, 2009

Research paper thumbnail of On a proof of Shelah

Research paper thumbnail of Problems with the category theoretic notions of ultraproducts

Bulletin of the Section of Logic, 1981

In this paper we try to initiate a search for an explicite and direct definition of ultraproducts... more In this paper we try to initiate a search for an explicite and direct definition of ultraproducts in categories which would share some of the attractive properties of products, coproducts, limits, and related category theoretic notions. Consider products as a motivating example. ...

Research paper thumbnail of Vienna Circle and Logical Analysis of Relativity Theory

In this paper we present some of our school's results in the area of building up relativity t... more In this paper we present some of our school's results in the area of building up relativity theory (RT) as a hierarchy of theories in the sense of logic. We use plain first-order logic (FOL) as in the foundation of mathematics (FOM) and we build on experience gained in FOM. The main aims of our school are the following: We

Research paper thumbnail of Closed Timelike Curves in Relativistic Computation

In this paper, we investigate the possibility of using closed timelike curves (CTCs) in relativis... more In this paper, we investigate the possibility of using closed timelike curves (CTCs) in relativistic hypercomputation. We introduce a wormhole based hypercomputation scenario which is free from the common worries, such as the blueshift problem. We also discuss the physical reasonability of our scenario, and why we cannot simply ignore the possibility of the existence of spacetimes containing CTCs.

Research paper thumbnail of On Logical Analysis of Relativity Theories

The aim of this paper is to give an introduction to our axiomatic logical analysis of relativity ... more The aim of this paper is to give an introduction to our axiomatic logical analysis of relativity theories.

Research paper thumbnail of Endoftime

This is Part I of the presentation of a talk given on September 27, 2013 at the Logic and Philoso... more This is Part I of the presentation of a talk given on September 27, 2013 at the Logic and Philosophy of Mathematics seminar of ELTE University, Budapest. We present a concrete mathematical realization for the Leibnizian relationist concept of time and space, via a logical analysis of exploring time and space experimentally. We start out from ideas in James Ax’s 1978 paper entitled “The elementary foundations of spacetime”.

Research paper thumbnail of Finite-variable logics do not have weak Beth definability property

We prove that n-variable logics do not have the weak Beth definability property, for all n greate... more We prove that n-variable logics do not have the weak Beth definability property, for all n greater than 2. This was known for n=3 (Ildik\'o Sain and Andr\'as Simon), and for n greater than 4 (Ian Hodkinson). Neither of the previous proofs works for n=4. In this paper we settle the case of n=4, and we give a uniform, simpler proof for all n greater than 2. The case for n=2 is still open.

Research paper thumbnail of Finite-Variable Logics Do Not Have Weak Beth Definability Property

Studies in Universal Logic, 2015

Research paper thumbnail of Completeness problems in verification of programs and program schemes

Lecture Notes in Computer Science, 1979

Research paper thumbnail of Changing a Semantics: Opportunism or Courage?

Studies in Universal Logic, 2014

Research paper thumbnail of Taming logic

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

Studia Scientiarum Mathematicarum Hungarica, 2001

Research paper thumbnail of A non representable infinite dimensional quasi-polyadic equality algebra with a representable cylindric reduct

Studia Scientiarum Mathematicarum Hungarica, 2013

Research paper thumbnail of Can new physics challenge “old” computational barriers?

Research paper thumbnail of Applied Logic Conference

Research paper thumbnail of tional theory of RRA is recursively enumernble but not decidable

Research paper thumbnail of Problem-oriented language hierarchy and the engagement of logic

Research paper thumbnail of Sufficient and Necessary Condition for the Completeness of a Calculus

Research paper thumbnail of D3FIKITI0N Theory as Basis for a Creative Problem Solver

Research paper thumbnail of Approach to Abstract Model Theory in Category Theoretical Frame

Research paper thumbnail of Not all representable cylindric algebras are neat reducts

Log In