ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let Lor=(+,−,⋅,<,0,1)L_{\text{or}}=(+,-,\cdot,<,0,1) be the language of ordered rings, and let Lexp⁡=Lor∪{exp⁡}L_{\exp}=L_{\text{or}}\cup\{\exp\}, where exp⁡\exp is a unary function symbol. Let Rexp⁡\mathbb{R}_{\exp} denote the Lexp⁡L_{\exp}-structure with underlying set R\mathbb{R} in which the symbols of LorL_{\text{or}} receive their usual interpretations in the ordered real field and exp⁡\exp is interpreted as the real exponential function x↦exx\mapsto e^{x}. Let

Th⁡(Rexp⁡)={φ:φ is an Lexp⁡-sentence and Rexp⁡⊨φ}.\operatorname{Th}(\mathbb{R}_{\exp})=\{\varphi : \varphi \text{ is an } L_{\exp}\text{-sentence and } \mathbb{R}_{\exp}\models\varphi\}.

Then Th⁡(Rexp⁡)\operatorname{Th}(\mathbb{R}_{\exp}) is decidable: there is an effective procedure which, given any Lexp⁡L_{\exp}-sentence φ\varphi, determines whether

Rexp⁡⊨φ.\mathbb{R}_{\exp}\models\varphi.

Record

Added
Links

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.