Some local definability results on countable topological structures

1983 ◽  
Vol 48 (3) ◽  
pp. 683-692 ◽  
Author(s):  
Holger Eisenmenger

L denotes a fixed finitary similarity type, B, respectively P a new relation symbol, an L-structure in the usual sense, and (, σ) a topological L-structure, where σ is a topology on A. (, σ) is countable if is countable and σ has a countable base. The formal language for our study of topological structures is . is the least fragment of the (monadic) second-order, infinitary language closed under negation (⇁), countable disjunction (∨), countable conjunction (∧), quantification over individual variables (∃ν, ∀ν), and quantification over set variables in the form ∃V(t ∈ V → φ) [respectively ∃V(t ∈ V → φ] where t is an L-term and each free occurrence of V in φ is negative [respectively positive]. We abbreviate ∃V(t ∈ V ∧ φ) and ∀V(t ∈ V → φ) by ∃V ∈ ν φ respectively ∀V ∈ ν φ. (For detailed information on we reIer to [1].)i, j, … m, n range over ω. a, x, etc. denote finite tuples; a ∈ A means that all members of a are in A. IdA denotes the identity on A, Perm(A) the set of all permutations of A, and Aut() (respectively Aut(, σ)) the set of all automorphisms of (respectively (σ)). Let F ⊆ Perm(A), B ⊆ Am(m ≥ 1), and μ be a system of subsets of A. B (respectively μ) is called invariant under F if for all ƒ ∈ F, ƒ(B) = B (respectively ƒ(μ) = μ). denotes the least system of subsets of A which contains μ and which is closed under arbitrary union, .For the rest of this paragraph let A be a countable nonempty set.

1950 ◽  
Vol 15 (2) ◽  
pp. 81-91 ◽  
Author(s):  
Leon Henkin

The first order functional calculus was proved complete by Gödel in 1930. Roughly speaking, this proof demonstrates that each formula of the calculus is a formal theorem which becomes a true sentence under every one of a certain intended class of interpretations of the formal system.For the functional calculus of second order, in which predicate variables may be bound, a very different kind of result is known: no matter what (recursive) set of axioms are chosen, the system will contain a formula which is valid but not a formal theorem. This follows from results of Gödel concerning systems containing a theory of natural numbers, because a finite categorical set of axioms for the positive integers can be formulated within a second order calculus to which a functional constant has been added.By a valid formula of the second order calculus is meant one which expresses a true proposition whenever the individual variables are interpreted as ranging over an (arbitrary) domain of elements while the functional variables of degree n range over all sets of ordered n-tuples of individuals. Under this definition of validity, we must conclude from Gödel's results that the calculus is essentially incomplete.It happens, however, that there is a wider class of models which furnish an interpretation for the symbolism of the calculus consistent with the usual axioms and formal rules of inference. Roughly, these models consist of an arbitrary domain of individuals, as before, but now an arbitrary class of sets of ordered n-tuples of individuals as the range for functional variables of degree n. If we redefine the notion of valid formula to mean one which expresses a true proposition with respect to every one of these models, we can then prove that the usual axiom system for the second order calculus is complete: a formula is valid if and only if it is a formal theorem.


Author(s):  
Adam Jardine

<p>Autosegmental Phonology is studied in the framework of Formal Language Theory, which classifies the computational complexity of patterns. In contrast to previous computational studies of Autosegmental Phonology, which were mainly concerned with finite-state implementations of the formalism, a methodology for a model-theoretic study of autosegmental diagrams with monadic second-order logic is introduced. Monadic second order logic provides a mathematically rigorous way of studying autosegmental formalisms, and its complexity is well understood. The preliminary conclusion is that autosegmental diagrams which conform to the well-formedness constraints defined here likely describe at most regular sets of strings.</p>


1976 ◽  
Vol 41 (2) ◽  
pp. 337-340
Author(s):  
Scott K. Lehmann

This note describes a simple interpretation * of modal first-order languages K with but finitely many predicates in derived classical second-order languages L(K) such that if Γ is a set of K-formulae, Γ is satisfiable (according to Kripke's 55 semantics) iff Γ* is satisfiable (according to standard (or nonstandard) second-order semantics).The motivation for the interpretation is roughly as follows. Consider the “true” modal semantics, in which the relative possibility relation is universal. Here the necessity operator can be considered a universal quantifier over possible worlds. A possible world itself can be identified with an assignment of extensions to the predicates and of a range to the quantifiers; if the quantifiers are first relativized to an existence predicate, a possible world becomes simply an assignment of extensions to the predicates. Thus the necessity operator can be taken to be a universal quantifier over a class of assignments of extensions to the predicates. So if these predicates are regarded as naming functions from extensions to extensions, the necessity operator can be taken as a string of universal quantifiers over extensions.The alphabet of a “finite” modal first-order language K shall consist of a non-empty countable set Var of individual variables, a nonempty finite set Pred of predicates, the logical symbols ‘¬’ ‘∧’, and ‘∧’, and the operator ‘◊’. The formation rules of K generate the usual Polish notations as K-formulae. ‘ν’, ‘ν1’, … range over Var, ‘P’ over Pred, ‘A’ over K-formulae, and ‘Γ’ over sets of K-formulae.


1992 ◽  
Vol 57 (2) ◽  
pp. 478-500
Author(s):  
Shaughan Lavine

AbstractLet be an admissible structure. A cPCd() class is the class of all models of a sentence of the form , where is an -r.e. set of relation symbols and Φ is an -r.e. set of formulas of ℒ∞,ω that are in . The main theorem is a generalization of the following: Let be a pure countable resolvable admissible structure such that is not Σ-elementarily embedded in HYP(). Then a class K of countable structures whose universes are sets of urelements is a cPCd() class if and only if for some Σ formula σ (with parameters from ), is in K if and only if is a countable structure with universe a set of urelements and σ, where , the smallest admissible set above relative to , is a generalization of HYP to structures with similarity type Σ over that is defined in this article. Here we just note that when Lα is admissible, HYPLα() is Lβ() for the least β ≥ α such that Lβ() is admissible, and so, in particular, that is just HYP() in the usual sense when has a finite similarity type.The definition of is most naturally formulated using Adamson's notion of a +-admissible structure (1978). We prove a generalization from admissible to +-admissible structures of the well-known truncation lemma. That generalization is a key theorem applied in the proof of the generalized Spector-Gandy theorem.


2014 ◽  
Vol 72 (1) ◽  
Author(s):  
Muhammad Azrin Ahmad ◽  
Nor Haniza Sarmin ◽  
Wan Heng Fong ◽  
Yuhani Yusof

DNA splicing process is a study on the recombinant behavior of double-stranded DNA molecules with the existence of restriction enzyme and ligase. Head introduced the first mathematical model of splicing systems by using the relation of informational macromolecules and formal language theory. In addition, a few laboratory experiments have been conducted in order to verify certain types of splicing language called inert/adult, transient and limit language. Previously, researchers have focused on those types of splicing languages.   Recently, an extension of limit languages namely second order limit language has been introduced. In this paper, the difference between second order limit languages and non-second order limit languages is depicted in some examples. Then, the formations of second order limit language in Yusof-Goode splicing system are investigated. 


1977 ◽  
Vol 42 (2) ◽  
pp. 277-288 ◽  
Author(s):  
John T. Baldwin ◽  
Joel Berman

A varietyV(equational class of algebras) satisfies a strong Malcev condition ∃f1,…, ∃fnθ(f1, …,fn,x1, …,xm) where θ is a conjunction of equations in the function variablesf1, …,fnand the individual variablesx1, …,xm, if there are polynomial symbolsp1, …,pnin the language ofVsuch that ∀x1, …,xmθ(p1…,pn,x1, …,xm) is a law ofV. Thus a strong Malcev condition involves restricted second order quantification of a strange sort. The quantification is restricted to functions which are “polynomially definable”. This notion was introduced by Malcev [6] who used it to describe those varieties all of whose members have permutable congruence relations. The general formal definition of Malcev conditions is due to Grätzer [1]. Since then and especially since Jónsson's [3] characterization of varieties with distributive congruences there has been extensive study of strong Malcev conditions and the related concepts: Malcev conditions and weak Malcev conditions.In [9], Taylor gives necessary and sufficient semantic conditions for a class of varieties to be defined by a (strong) Malcev condition. A key to the proof is the translation of the restricted second order concepts into first order concepts in a certain many sorted language. In this paper we show that, given this translation, Taylor's theorem is an easy consequence of a result of Tarski [8] and the standard preservation theorems of first order logic.


لارك ◽  
2019 ◽  
Vol 1 (22) ◽  
pp. 475-485
Author(s):  
ليث أثير يوسف

كان الهدف من البحث بيان منطق الرتبة الاولى ومكوناته ورموزه وصيغه ومصطلحاته وكل مايتعلق به لما يمثل من اهمية في اوساط المنطق الرياضي وأهميته في حياتنا العملية فهذا المنطق له صيغ خاصة وطريقة في كتابة الرموز تختلف عن بقية حقول المنطق الرياضي فالمحمول هو من سيحدد شكل المصطلح وسيسلك في داخل الصيغة سلوك وظائف (دالية)( functional) والصيغة المعقدة تحتوي على اكثر من محمول فيها اضافة الى الاسوار التي ستحدد القضية من ناحية (الكم) ناهيك عن الية قيم صدق وكذب المصطلح والصيغ في هذا المنطق عن طريق منهج التفسير (interpretation) والحقيقة ان هذا النهج غريب وغير معروف في اوساط الاليات الرمزية والانساق المنطقية في منطق القضايا سواء بصيغه البسيطة أو المعقدة فقيم الصدق ( ثنائية القيم) هي ستحدد صدق الصيغ ، كما ان لمنطق الرتبة الاولى اساسات جعلت منه منطلقاً لاقامة منطق الرتبة الثانية (second order logic)[i] وهو النموذج المطور بالياته البرهانية وصيغه المعقدة عن الاول وكذلك اعتبر منطق الرتبة الاولى منطلقا لاقامة نظرية النماذج أو النمذجة ( models theory)[ii] تلك النظرية الرياضية التي تجمع مابين المجموعات الكلية في نظرية المجموعات والصيغ الجبرية بالاضافة الى ان منطق الرتبة الاولى ذا اهمية في تكوين لغات البرمجة المنطقية (logical programming language) ومنها لغة برولوغ (prolog) الشهيرة التي تعتمد بالاساس على هذا المنطق في بناء وتفسير صيغها وكذلك في مجال الذكاء الصناعي (artificial intelligence) . لذا كان من الضروري تقديم بيان ملخص ومفصل عن مكونات هذا النوع من المنطق الرياضي وشرح الياته الرياضية والمنطقية   [i] ) للاستزادة من الشرح المفصل حول موضوع (منطق الرتبة الثانية –second order logic) ينظر كتاب STEWART SHAPIRO, foundations without foundationalism, CLARENDON PRESS,Uk 1991,p.96 ) [ii] ) يعرفها جانغ (cc.chang) في كتابه (model theory) في مقدمته (ص1) الى ان هذه النظرية فرع من المنطق الرياضي وتتعامل مع اللغة الرمزية وتفسيراتها (formal language and its interpretations) أو مايسمى بالنماذج (Models)


1987 ◽  
Vol 52 (1) ◽  
pp. 219-226 ◽  
Author(s):  
Hans Läuchli ◽  
Christian Savioz

AbstractLet S2S [WS2S] respectively be the strong [weak] monadic second order theory of the binary tree T in the language of two successor functions. An S2S-formula whose free variables are just individual variables defines a relation on T (rather than on the power set of T). We show that S2S and WS2S define the same relations on T, and we give a simple characterization of these relations.


1969 ◽  
Vol 34 (2) ◽  
pp. 166-170 ◽  
Author(s):  
J. Richard Buchi ◽  
Lawrence H. Landweber

Let be a relational system whereby D is a nonempty set and P1 is an m1-ary relation on D. With we associate the (weak) monadic second-order theory consisting of the first-order predicate calculus with individual variables ranging over D; monadic predicate variables ranging over (finite) subsets of D; monadic predicate quantifiers; and constants corresponding to P1, P2, …. We will often use ambiguously to mean also the set of true sentences of .


2014 ◽  
Vol 71 (5) ◽  
Author(s):  
Muhammad Azrin Ahmad ◽  
Nor Haniza Sarmin ◽  
Wan Heng Fong ◽  
Yuhani Yusof

Splicing system, which is an abstraction of operations on DNA molecules, can be modelled mathematically under the framework of formal language theory and informational macromolecules. The recombinant behavior of the set of double-stranded DNA molecules under the influence of restriction enzyme and ligase further lead to the cut and paste phenomenon in splicing system. The theoretical study of splicing language has contributed to a new type of splicing language known as a second order limit language, which is an extension of limit language. Some types of splicing system can produce second order limit language. Y-G splicing system is chosen among other models to model the DNA splicing process as this model preserves the biological traits and presents the transparent behavior of the DNA splicing process. In this paper, the relation between second order limit language with simple splicing and semi-simple splicing system are presented.


Sign in / Sign up

Export Citation Format

Share Document