| Articolul precedent |
| Articolul urmator |
 |
 599 2 |
| Ultima descărcare din IBN: 2022-11-03 23:47 |
 SM ISO690:2012MURAVITSKY, Alexei. Oracle as Modality: Two Examples. In: Conference on Mathematical Foundations of Informatics, Ed. 2017, 9-11 noiembrie 2017, Chișinău. Chișinău, Republica Moldova: "VALINEX" SRL, 2017, pp. 126-129. ISBN 978‐9975‐4237‐6‐2. |
| EXPORT metadate: Google Scholar Crossref CERIF DataCite Dublin Core |
| Conference on Mathematical Foundations of Informatics 2017 | ||||||
|
Conferința "Conference on Mathematical Foundations of Informatics" 2017, Chișinău, Moldova, 9-11 noiembrie 2017 | ||||||
|
||||||
| Pag. 126-129 | ||||||
|
||||||
 Descarcă PDF |
||||||
| Rezumat | ||||||
We propose to use modality in conditional contexts where some of the elements of conclusion must satisfy certain constraints in order for the conclusion to be fulfilled. Thus, modality acts as an oracle in relative algorithms, if we understand deducibility in a base logic as recursiveness and deducibility in a modal conservative consistent extension of the base logic as relative recursiveness. |
||||||
| Cuvinte-cheie relative recursiveness, intuitionistic propositional logic, classical tautology, Heyting algebra, modality |
||||||
|
|
|
|
