activity
20112023
most citedTuring machines on represented sets, a model of computation for Analysis

24 citations · 34 across the 6 of their papers we have counts for

collaborators

6 papers

math.LO2023

The Craig Interpolation Property in First-order Gödel Logic

Seyed Mohammad Amin Khatami, Massoud Pourmahdian, Nazanin R. Tavana

In this article, a model-theoretic approach is proposed to prove that the first-order Gödel logic, , as well as its extension associated with first-order…

cs.LO2020

A recursion theoretic foundation of computation over real numbers

Keng Meng Ng, Nazanin R. Tavana, Yue Yang

We define a class of computable functions over real numbers using functional schemes similar to the class of primitive and partial recursive functions defined by Gödel and Kleene.…

cs.LO2020

An effective version of definability in metric model theory

Nazanin Roshandel Tavana

In this paper, a computably definable predicate is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively prese…

cs.LO2014★ 6 cited

Representations of measurable sets in computable measure theory

Klaus Weihrauch, Nazanin Tavana-Roshandel

This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by r…

math.LO2013★ 4 cited

From rational Godel logic to continuous ultrametric logic

Seyed Mohammad Amin Khatami, Masoud Pourmahdian, Nazanin R. Tavana

This paper is devoted to systematic studies of some extensions of first-order Gödel logic. The first extension is the first-order rational Gödel logic which is an extension of firs…

math.LO2011★ 24 cited

Turing machines on represented sets, a model of computation for Analysis

Nazanin Tavana, Klaus Weihrauch

We introduce a new type of generalized Turing machines (GTMs), which are intended as a tool for the mathematician who studies computability in Analysis. In a single tape cell a GTM…