نتایج جستجو برای: first order cohomology
تعداد نتایج: 2164072 فیلتر نتایج به سال:
We consider successor-invariant first-order logic (FO+ succ)inv, consisting of sentences Φ involving an “auxiliary” binary relation S such that (A, S1) |= Φ ⇐⇒ (A, S2) |= Φ for all finite structures A and successor relations S1, S2 on A. A successorinvariant sentence Φ has a well-defined semantics on finite structures A with no given successor relation: one simply evaluates Φ on (A, S) for an a...
We prove that for the class of sets of words indexed by countable scattered linear orderings, there is an equivalence between definability in first-order logic, star-free expressions with marked product, and recognizability by finite aperiodic semigroups which satisfy the equation xωx−ω = x. 1998 ACM Subject Classification F.4.1 Mathematical Logic; F.4.3 Formal Languages
Mathematical models described by multivariable functions f(x ) where x 1⁄4 ðx1;...; xnÞ are investigated. If the model output is influenced mainly by low order combinations of input variables x1;...; xn; an attempt can be made to construct a low order approximation to the model using values of f(x ) only. q 2002 Elsevier Science Ltd. All rights reserved.
We propose a model-theoretic framework for investigating profinite structures. We prove that in many cases small profinite structures interpret infinite groups. This corresponds to results of Hrushovski and Peterzil on interpreting groups in locally modular stable and o-minimal structures.
First Order ID-Logic interprets general first order, nonmonotone, inductive definability by generalizing the wellfounded semantics for logic programs. We show that, for general (thus perhaps infinite) structures, inference in First Order ID-Logic is completeΠ2 over the natural numbers. We also prove a Skolem Theorem for the logic: every consistent formula of First Order ID-Logic has a countable...
Semantic attachment is provided by FOL as a means for associating model values (i.e. LISP code) to symbols of a first order language. This paper presents an algorithm that automatically generates semantic attachments in FOL and discusses the advantages deriving from its use.
Ordinary first-order logic has the property that two formulas φ and ψ have the same meaning in a structure if and only if the formula φ ↔ ψ is true in the structure. We prove that independence-friendly logic does not have this property. §
A method for encoding formulas in rst-order logic with equality into some equational logics and their associated propositional logics is presented. This yields some new strategies for theorem-proving in rst-order logic with equality. We outline the techniques and give a simple illustration of their use.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید