Hostname: page-component-7b7567c8c-8tzhz Total loading time: 0 Render date: 2026-11-19T21:33:51.889Z Has data issue: false hasContentIssue false

MODEL-THEORETIC CHARACTERIZATION OF INTUITIONISTIC PROPOSITIONAL FORMULAS

Published online by Cambridge University Press:  19 March 2013

GRIGORY K. OLKHOVIKOV*
Affiliation:
Department of Philosophy, Ural Federal University
*
*DEPARTMENT OF PHILOSOPHY URAL FEDERAL UNIVERSITY 51 LENIN AVENUE, OFF 332 YEKATERINBURG RUSSIA 620083 E-mail: grigory.olkhovikov@usu.ru, grigory.olkhovikov@gmail.com
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Notions of k-asimulation and asimulation are introduced as asymmetric counterparts to k-bisimulation and bisimulation, respectively. It is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to k-asimulations for some k, and then that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula iff it is invariant with respect to asimulations. Finally, it is proved that a first-order formula is equivalent to a standard translation of an intuitionistic propositional formula over the class of intuitionistic Kripke models iff it is invariant with respect to asimulations between intuitionistic models.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2013