# Model-theoretic characterization of predicate intuitionistic formulas

Source: [Model-theoretic characterization of predicate intuitionistic formulas](<https://www.sota2.com/research/paper/68fa51bb1e209131ce975ef1>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T11:33:07.240Z

Authors: Grigory K. Olkhovikov

Published: 2012-02-02T22:20:46.000Z

## Abstract

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).

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1202.1195>)

[PDF](<https://arxiv.org/pdf/1202.1195.pdf>)
