Model-theoretic characterization of predicate intuitionistic formulas

Details Model-theoretic characterization of predicate intuitionistic formulas Model-theoretic characterization of predicate intuitionistic formulas

2012-02-02

arxiv.org/abs/1202.1195v1

Mathematics

Logic

Scientific paper

Notions of asimulation and k-asimulation introduced in [Olkhovikov, 2011] are extended onto the level of 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 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 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 asimulations between intuitionistic models (intuitionistic models with constant domain).

Affiliated with

Also associated with

No associations

Rating

Model-theoretic characterization of predicate intuitionistic formulas does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Model-theoretic characterization of predicate intuitionistic formulas, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Model-theoretic characterization of predicate intuitionistic formulas will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-5652