Defining algorithmically presented structures in first order logic
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3649971 (Why is no real title available?)
- scientific article; zbMATH DE number 4217488 (Why is no real title available?)
- scientific article; zbMATH DE number 4007714 (Why is no real title available?)
- scientific article; zbMATH DE number 4053598 (Why is no real title available?)
- scientific article; zbMATH DE number 4079406 (Why is no real title available?)
- scientific article; zbMATH DE number 3703962 (Why is no real title available?)
- scientific article; zbMATH DE number 3723836 (Why is no real title available?)
- scientific article; zbMATH DE number 53151 (Why is no real title available?)
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 1302879 (Why is no real title available?)
- scientific article; zbMATH DE number 2040323 (Why is no real title available?)
- scientific article; zbMATH DE number 1531926 (Why is no real title available?)
- scientific article; zbMATH DE number 2167522 (Why is no real title available?)
- scientific article; zbMATH DE number 1450824 (Why is no real title available?)
- scientific article; zbMATH DE number 3266609 (Why is no real title available?)
- scientific article; zbMATH DE number 3290336 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A Note on Positive Equivalence Relations
- A quest for algorithmically random infinite structures
- Abstract computability and algebraic specification
- Algebraic specifications of computable and semicomputable data types
- Algebras over negative equivalences
- An introduction to the Scott complexity of countable structures and a survey of recent results
- Automatic presentations of structures
- COMPUTABLY ENUMERABLE ALGEBRAS, THEIR EXPANSIONS, AND ISOMORPHISMS
- CONSTRUCTIVE ALGEBRAS I
- Classifying positive equivalence relations
- Complexity of Scott sentences
- Computable Algebra, General Theory and Theory of Computable Fields
- Computable quotient presentations of models of arithmetic and set theory
- Computable structures of rank \(\omega _1^{\mathrm{CK}}\)
- Computably enumerable equivalence relations
- Definability of linear orders over negative equivalences
- Equational specifications, complete term rewriting systems, and computable and semicomputable algebras
- Final algebras, cosemicomputable algebras and degrees of unsolvability
- Finitely presented expansions of computably enumerable semigroups
- Finitely presented expansions of groups, semigroups, and algebras
- Formal methods for software engineering. Languages, methods, application domains. With a foreword by Manfred Broy and a contribution on the origins and development of formal methods by John V. Tucker
- Graphs realised by r.e. equivalence relations
- Handbook of recursive mathematics. Vol. 1: Recursive model theory
- Homomorphisms onto negative algebras
- Index sets and Scott sentences
- Initial and Final Algebra Semantics for Data Type Specifications: Two Characterization Theorems
- Linear orders realized by c.e. equivalence relations
- Model-theoretic complexity of automatic structures
- On optimal Scott sentences of finitely generated algebraic structures
- Positive algebras with countable congruence lattices
- Quantifier Free Definability on Infinite Algebras
- Randnomness, computability, and algebraic specifications
- Random Subgroups of Rationals
- Recursively separable enumerated algebras
- Reducibilities among equivalence relations induced by recursively enumerable structures
- SCOTT COMPLEXITY OF COUNTABLE STRUCTURES
- Separating Classes of Groups by First-Order Sentences
- The completeness of the algebraic specification methods for computable data types
- The complexity of computable categoricity
- Turing's legacy. Developments from Turing's ideas in logic
- Unary automatic graphs: an algorithmic perspective
- Universal computably enumerable equivalence relations
- Verification
- ^0_1-presentations of algebras
This page was built for publication: Defining algorithmically presented structures in first order logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6970228)
