Skip to main content (access key 's'), Skip to navigation (access key 'n'), Accessibility information (access key '0')
EuDML - The European Digital Mathematics Library

Login | Register | (Why Register?)

  • Home
  • Advanced Search
  • Browse by Subject
  • Browse by Journals
  • Refs Lookup
  • Subjects
  • 03-XX Mathematical logic and foundations
  • 03Dxx Computability and recursion theory
  • 03D35 Undecidability and degrees of sets of sentences

03Dxx Computability and recursion theory

  • 03D03 Thue and Post systems, etc.
  • 03D05 Automata and formal grammars in connection with logical questions
  • 03D10 Turing machines and related notions
  • 03D15 Complexity of computation (including implicit computational complexity)
  • 03D20 Recursive functions and relations, subrecursive hierarchies
  • 03D25 Recursively (computably) enumerable sets and degrees
  • 03D28 Other Turing degree structures
  • 03D30 Other degrees and reducibilities
  • 03D32 Algorithmic randomness and dimension
  • 03D35 Undecidability and degrees of sets of sentences
  • 03D40 Word problems, etc.
  • 03D45 Theory of numerations, effectively presented structures
  • 03D50 Recursive equivalence types of sets and structures, isols
  • 03D55 Hierarchies
  • 03D60 Computability and recursion theory on ordinals, admissible sets, etc.
  • 03D65 Higher-type and set recursion theory
  • 03D70 Inductive definability
  • 03D75 Abstract and axiomatic computability and recursion theory
  • 03D78 Computation over the reals
  • 03D80 Applications of computability and recursion theory
  • 03D99 None of the above, but in this section
  • Items

All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Page 1

Displaying 1 – 1 of 1

Showing per page

Recursive inseparability of the sets of identically valid and finitely refutable formulas of some elementary theories of varieties.

Ursu, V.I. (2000)

Siberian Mathematical Journal

Currently displaying 1 – 1 of 1

Page 1

EuDML
  • About EuDML initiative
  • Feedback
  •  version 2.1.7