Zobrazeno 1 - 10
of 28
pro vyhledávání: '"Morteza Moniri"'
Autor:
Abolfazl Alam, Morteza Moniri
Publikováno v:
Bulletin of the Section of Logic, Vol 51, Iss 2, Pp 163-176 (2022)
In this paper, we study bounded versions of some model-theoretic notions and results. We apply these results to the context of models of bounded arithmetic theories as well as some related complexity questions. As an example, we show that if the theo
Externí odkaz:
https://doaj.org/article/4dca557a86004aa1b3d4cb446999fef0
Publikováno v:
International Studies in the Philosophy of Science. 35:171-188
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7a50c8ba3c6c0eef38dd3ee0854eec06
https://doi.org/10.1080/02698595.2022.2144457
https://doi.org/10.1080/02698595.2022.2144457
Autor:
Somayeh Chopoghloo, Morteza Moniri
Publikováno v:
Journal of Logic and Computation. 31:1640-1659
In this paper, we consider the logic ${\textsf{ITL}}^{e}$, a variant of intuitionistic linear temporal logic that is interpreted over the class of dynamic Kripke frames. These are bi-relational structures of the form $ \langle{W, \preccurlyeq , f}\ra
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::33fd481fb4a8285280ef8edded43886c
https://doi.org/10.1093/logcom/exab041
https://doi.org/10.1093/logcom/exab041
Publikováno v:
Logic Journal of the IGPL.
In this paper we first introduce a new neighbourhood semantics for propositional intuitionistic logic. We then naturally extend this semantics to first-order intuitionistic logic. We also study bisimulation between neighbourhood models and prove some
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::46598eda0b6e5bbb5f6fabba5d20f397
https://doi.org/10.1093/jigpal/jzac069
https://doi.org/10.1093/jigpal/jzac069
Autor:
Morteza Moniri, Somayeh Chopoghloo
Publikováno v:
Logic Journal of the IGPL. 30:124-142
Dynamic topological logic ($\textsf{DTL}$) is a multi-modal logic that was introduced for reasoning about dynamic topological systems, i.e. structures of the form $\langle{\mathfrak{X}, f}\rangle $, where $\mathfrak{X}$ is a topological space and $f$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::97ff41dad4b61beee9c2509c579c40fe
https://doi.org/10.1093/jigpal/jzaa055
https://doi.org/10.1093/jigpal/jzaa055
Publikováno v:
Logic Journal of the IGPL. 27:659-670
We define a class of first-order formulas $\mathsf{P}^{\ast }$ which exactly contains formulas $\varphi$ such that satisfaction of $\varphi$ in any classical structure attached to a node of a Kripke model of intuitionistic predicate logic deciding at
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e189399eca35c7a91d1441c97c0021ad
https://doi.org/10.1093/jigpal/jzy075
https://doi.org/10.1093/jigpal/jzy075
Publikováno v:
Logic Journal of the IGPL. 26:464-474
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::202ef36ab8df67cc9caa620c99d4fbd5
https://doi.org/10.1093/jigpal/jzy007
https://doi.org/10.1093/jigpal/jzy007
Publikováno v:
Logic in Tehran: Proceedings of theWorkshop and Conference on Logic, Algebra and Arithmetic, held October 18–22, 2003
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::60b5b748295d62930dcf87b67133a48d
https://doi.org/10.1017/9781316755747.015
https://doi.org/10.1017/9781316755747.015
Publikováno v:
Journal of Intelligent & Fuzzy Systems. 26:2993-3004
In this paper, we introduce the notions of neutrosophic deductive filter, Boolean neutrosophic deductive filter (BNDF) and implicative neutrosophic deductive filter (INDF) on BL-algebras as generalizations of the fuzzy corresponding versions. We also
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02b4e20c04f79fcd226601c2a614fa98
https://doi.org/10.3233/ifs-130965
https://doi.org/10.3233/ifs-130965
Autor:
Morteza Moniri
Publikováno v:
Fundamenta Informaticae. 123:305-315
First we define a new class of fuzzy Turing machines that we call Generalized Fuzzy Turing Machines. Our machines are equipped with rejecting states as well as accepting states. While we use a t-norm for computing degrees of accepting or rejecting pa
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e0e10cef7ab1f290275fa4551e21d392
https://doi.org/10.3233/fi-2013-812
https://doi.org/10.3233/fi-2013-812