scientific article; zbMATH DE number 3266609
From MaRDI portal
Publication:5551146
zbMath0166.26003MaRDI QIDQ5551146
Publication date: 1965
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (62)
WHICH CLASSES OF STRUCTURES ARE BOTH PSEUDO-ELEMENTARY AND DEFINABLE BY AN INFINITARY SENTENCE? ⋮ LOGICALITY AND MODEL CLASSES ⋮ Effective choice of constructivizations and recursive consistency of problems on constructive models ⋮ On observational equivalence and algebraic specification ⋮ A robuster Scott rank ⋮ Modeling limits in hereditary classes: reduction and application to trees ⋮ On optimal Scott sentences of finitely generated algebraic structures ⋮ Scott ranks of models of a theory ⋮ AN INTRODUCTION TO THE SCOTT COMPLEXITY OF COUNTABLE STRUCTURES AND A SURVEY OF RECENT RESULTS ⋮ Can logic be combined with probability? Probably ⋮ A calculus of refinements for program derivations ⋮ Metric Scott analysis ⋮ Modelling uncertain inference ⋮ INTERPRETING A FIELD IN ITS HEISENBERG GROUP ⋮ Structures elementarily equivalent relative to infinitary languages to models of higher power ⋮ Unnamed Item ⋮ Index sets and Scott sentences ⋮ Model Theoretic Complexity of Automatic Structures (Extended Abstract) ⋮ Classes of algebraic structures ⋮ Describing groups ⋮ INTERLEAVING LOGIC AND COUNTING ⋮ On complexity of Ehrenfeucht-Fraïssé games ⋮ Model-theoretic complexity of automatic structures ⋮ Effectively Existentially-Atomic Structures ⋮ Unnamed Item ⋮ Countable structures for uncountable infinitary languages ⋮ Complexity of Scott sentences ⋮ Borel canonization of analytic sets with Borel sections ⋮ Some new computable structures of high rank ⋮ Infinite lexicographic products ⋮ Scott sentences for certain groups ⋮ Degree Spectra of Relations on a Cone ⋮ Atomic models higher up ⋮ Some proof theoretic-properties of dense linear orderings and countable well-orderings ⋮ The property “arithmetic-is-recursive” on a cone ⋮ Hanf number for Scott sentences of computable structures ⋮ DEGREES OF CATEGORICITY ON A CONE VIAη-SYSTEMS ⋮ Espaces de Baire et espaces de probabilité de structures rélationnelles ⋮ A modal proof theory for final polynomial coalgebras ⋮ Scott rank of Polish metric spaces ⋮ Some model theoretic results for \(\omega\)-logic ⋮ Classifying \(\aleph_ 0\)-categorical theories ⋮ Lefschetz's principle ⋮ Scott sentences for equivalence structures ⋮ Chain logic and Shelah's infinitary logic ⋮ Homogeneous and strictly homogeneous criteria for partial structures ⋮ Scattered sentences have few separable randomizations ⋮ Relativizing computable categoricity ⋮ Enumerations in computable structure theory ⋮ THE COMPLEXITY OF SCOTT SENTENCES OF SCATTERED LINEAR ORDERS ⋮ Definable functions of universal algebras and definable equivalence between algebras. ⋮ PDL with data constants ⋮ SCOTT COMPLEXITY OF COUNTABLE STRUCTURES ⋮ Effective choice for relations and reducibilities in classes of constructive and positive models ⋮ Primitive Jordan algebras ⋮ Finitely generated groups with the M. Hall property ⋮ Locally finite simple groups as a product of two inert subgroups ⋮ Local characterizations of infinite alternating and Lie type groups ⋮ A semiorthogonal sum of monocomposition algebras with unity ⋮ Superdecomposable pure injective modules over commutative valuation rings ⋮ An essay in combinatory dynamic logic ⋮ A boundedness principle for the Hjorth rank
This page was built for publication:
