Пожалуйста, используйте этот идентификатор, чтобы цитировать или ссылаться на этот ресурс:
http://elar.urfu.ru/handle/10995/102438
Полная запись метаданных
Поле DC | Значение | Язык |
---|---|---|
dc.contributor.author | Olkhovikov, G. K. | en |
dc.date.accessioned | 2021-08-31T15:03:38Z | - |
dc.date.available | 2021-08-31T15:03:38Z | - |
dc.date.issued | 2014 | - |
dc.identifier.citation | Olkhovikov G. K. Model-theoretic characterization of intuitionistic predicate formulas / G. K. Olkhovikov. — DOI 10.1093/logcom/ext014 // Journal of Logic and Computation. — 2014. — Vol. 24. — Iss. 4. — P. 809-829. | en |
dc.identifier.issn | 0955792X | - |
dc.identifier.other | Final | 2 |
dc.identifier.other | All Open Access, Green | 3 |
dc.identifier.other | https://www.scopus.com/inward/record.uri?eid=2-s2.0-84905178425&doi=10.1093%2flogcom%2fext014&partnerID=40&md5=5d7644459d54c6a69ebd5f17ee6b8478 | |
dc.identifier.other | http://arxiv.org/pdf/1202.1195 | m |
dc.identifier.uri | http://elar.urfu.ru/handle/10995/102438 | - |
dc.description.abstract | The article introduces notions of first-order asimulation and first-order k-asimulation, which extend notions of asimulation and k-asimulation introduced in Olkhovikov (2012, Review of Symbolic Logic, 6, 348-365) onto the level of intuitionistic predicate logic. We then prove that a first-order formula is equivalent to a standard translation of an intuitionistic predicate formula iff it is invariant with respect to first-order k-asimulations for some k, and then that a first-order formula is equivalent to a standard translation of an intuitionistic predicate formula iff it is invariant with respect to first-order asimulations. Finally, it is proved that a first-order formula is equivalent to a standard translation of an intuitionistic predicate formula over a class of intuitionistic models (intuitionistic models with constant domain) iff it is invariant with respect to first-order asimulations between intuitionistic models (intuitionistic models with constant domain). © 2013 The Author. | en |
dc.format.mimetype | application/pdf | en |
dc.language.iso | en | en |
dc.publisher | Oxford University Press | en |
dc.rights | info:eu-repo/semantics/openAccess | en |
dc.source | J Logic Comput | 2 |
dc.source | Journal of Logic and Computation | en |
dc.subject | CONSTANT DOMAINS | en |
dc.subject | FIRST-ORDER LOGIC | en |
dc.subject | INTUITIONISTIC LOGIC | en |
dc.subject | MODAL CHARACTERIZATION THEOREM | en |
dc.subject | MODEL THEORY | en |
dc.subject | FORMAL LOGIC | en |
dc.subject | CHARACTERIZATION THEOREMS | en |
dc.subject | FIRST ORDER LOGIC | en |
dc.subject | FIRST-ORDER FORMULAS | en |
dc.subject | INTUITIONISTIC LOGIC | en |
dc.subject | INTUITIONISTIC PREDICATE LOGIC | en |
dc.subject | MODEL THEORY | en |
dc.subject | MODEL-THEORETIC | en |
dc.subject | SYMBOLIC LOGIC | en |
dc.subject | EQUIVALENCE CLASSES | en |
dc.title | Model-theoretic characterization of intuitionistic predicate formulas | en |
dc.type | Article | en |
dc.type | info:eu-repo/semantics/article | en |
dc.type | info:eu-repo/semantics/publishedVersion | en |
dc.identifier.doi | 10.1093/logcom/ext014 | - |
dc.identifier.scopus | 84905178425 | - |
local.contributor.employee | Olkhovikov, G.K., Department of Philosophy, Ural Federal University, 51 Lenin Ave, Off. 332, Yekaterinburg, 620083, Russian Federation | |
local.description.firstpage | 809 | - |
local.description.lastpage | 829 | - |
local.issue | 4 | - |
local.volume | 24 | - |
local.contributor.department | Department of Philosophy, Ural Federal University, 51 Lenin Ave, Off. 332, Yekaterinburg, 620083, Russian Federation | |
local.identifier.pure | 422536 | - |
local.identifier.pure | fc20e329-6326-4f54-a6ff-94b5cb2624fa | uuid |
local.identifier.eid | 2-s2.0-84905178425 | - |
Располагается в коллекциях: | Научные публикации, проиндексированные в SCOPUS и WoS CC |
Файлы этого ресурса:
Файл | Описание | Размер | Формат | |
---|---|---|---|---|
2-s2.0-84905178425.pdf | 261,8 kB | Adobe PDF | Просмотреть/Открыть |
Все ресурсы в архиве электронных ресурсов защищены авторским правом, все права сохранены.