Equivalence and Inequivalence of Instances of Formulas
نویسنده
چکیده
An algorithm is presented for determining whether or not two instances of formulas are equal based on previous equality and inequality declarations. The equality determination algorithm is shown to be linear along with a completeness proof.
منابع مشابه
Linear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملTallness and level by level equivalence and inequivalence
We construct two models containing exactly one supercompact cardinal in which all nonsupercompact measurable cardinals are strictly taller than they are either strongly compact or supercompact. In the first of these models, level by level equivalence between strong compactness and supercompactness holds. In the other, level by level inequivalence between strong compactness and supercompactness ...
متن کاملEstimating equivalence with quantile regression.
Equivalence testing and corresponding confidence interval estimates are used to provide more enlightened statistical statements about parameter estimates by relating them to intervals of effect sizes deemed to be of scientific or practical importance rather than just to an effect size of zero. Equivalence tests and confidence interval estimates are based on a null hypothesis that a parameter es...
متن کاملInequivalence of Skew Hadamard Difference Sets and Triple Intersection Numbers Modulo a Prime
Recently, Feng and Xiang [10] found a new construction of skew Hadamard difference sets in elementary abelian groups. In this paper, we introduce a new invariant for equivalence of skew Hadamard difference sets, namely triple intersection numbers modulo a prime, and discuss inequivalence between Feng-Xiang skew Hadamard difference sets and the Paley difference sets. As a consequence, we show th...
متن کاملOn the Π2-completeness of Contextual Equivalence
In this note, we present a proof of Π2-completeness of contextual equivalence of Turing machines via a reduction of the language FIN to contextual inequivalence. FIN is the language of encodings 〈Mi〉 of Turing machines Mi for which the set Wi of inputs on which Mi halts (or the set of accepting inputs of Mi) is finite. FIN is known to be Σ 0 2-complete.
متن کامل