Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Nazanin Roshandel Tavana"'
Autor:
Nazanin Roshandel Tavana
Publikováno v:
AUT Journal of Mathematics and Computing, Vol 3, Iss 1, Pp 101-111 (2022)
In this paper, a computably definable predicate in metric structures is defined and characterized. Then, it is proved that every separable infinite-dimensional Hilbert structure in an effectively presented language is computable. Moreover, every defi
Externí odkaz:
https://doaj.org/article/e7e513c2495e4be1951c4294b1a3de57
Autor:
Nazanin Roshandel Tavana
Publikováno v:
Axioms, Vol 12, Iss 9, p 858 (2023)
Pavelka-style (rational) Gödel logic is an extension of Gödel logic which is denoted by RGL*. In this article, due to the approximate Craig interpolation property for RGL*, the Robinson theorem and approximate Beth theorem are presented and proved.
Externí odkaz:
https://doaj.org/article/5626a390f7894bb1b03c8bf998cbc292
Publikováno v:
Journal of Logic and Computation. 31:1660-1689
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 (1931, 1934) and Kleene (1936, Math. Ann., 112, 727–742). We show that this cla
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f2ea457da1ba520929424307f12c8dbe
https://doi.org/10.1093/logcom/exab042
https://doi.org/10.1093/logcom/exab042
Publikováno v:
Mathematical Structures in Computer Science. 25:1779-1798
This paper is a further investigation of a project carried out in Didehvar and Ghasemloo (2009) to study effective aspects of the metric logic. We prove an effective version of the omitting types theorem. We also present some concrete computable cons
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2ae93630b34c72cd5918a9ec4f92ab54
https://doi.org/10.1017/s0960129513000352
https://doi.org/10.1017/s0960129513000352
Publikováno v:
Journal of Logic and Computation. 26:1743-1767
This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many nullary logical
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5102856f482e30c82ef278567a00d723
https://doi.org/10.1093/logcom/exu065
https://doi.org/10.1093/logcom/exu065
Publikováno v:
Journal of Logic and Computation. 23:473-485
Our aim in this article is twofold. First, for an arbitrary closed subset V of [0,1] containing both 0 and 1, the compactness theorem for the Godel logic GV is investigated. Next, following Cintula and Navara (2004, Fuzzy sets and systems, 143, 59–
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b414a88631412a5e87ef9470001ec58e
https://doi.org/10.1093/logcom/exs037
https://doi.org/10.1093/logcom/exs037
Publikováno v:
Logic Journal of IGPL. 20:254-265
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c1912c617a4441258603fe119d8bdbb6
https://doi.org/10.1093/jigpal/jzr034
https://doi.org/10.1093/jigpal/jzr034
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 can store a symbol, a real number, a continuous real function or a pr
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::439de76bc6b3abc0180cb6a6ead4d0b2
http://arxiv.org/abs/1105.3335
http://arxiv.org/abs/1105.3335
