1 citations · 2 across the 5 of their papers we have counts for
5 papers
The Temporal Continuum
Mohammad Ardeshir, Rasoul Ramezanian
The continuum has been one of the most controversial topics in mathematics since the time of the Greeks. Some mathematicians, such as Euclid and Cantor, held the position that a li…
The provably total recursive functions and the MRDP theorem in Basic Arithmetic and its extensions
Mohammad Ardeshir, Erfan Khaniki, Mohsen Shahriari
We study Basic Arithmetic, BA introduced by W. Ruitenburg. BA is an arithmetical theory based on basic logic which is weaker than intuitionistic logic. We show that the class of th…
The -Provability Logic of HA*
Mohammad Ardeshir, Mojtaba Mojtahedi
For the Heyting Arithmetic HA, HA* is defined as the theory , where is called the box translation of . We characterize the -pr…
The _1 Provability Logic of HA
Mohammad Ardeshir, S. Mojtaba Mojtahedi
In this paper we introduce a modal theory , which is sound and complete for arithmetical _1 substitutions in , in other words, we will show that is the _…
Epistemic Learning Programs A Calculus for Describing Epistemic Action Models
Mohammad Ardeshir Rasoul Ramezanian
Dynamic Epistemic Logic makes it possible to model and reason about information change in multi-agent systems. Information change is mathematically modeled through epistemic action…