Search Results - "MSC 68Q25 Analysis of algorithms and problem complexity"

  • Showing 1 - 1 results of 1
Refine Results
  1. 1
    Cover Image

    The most nonelementary theory by Vorobyov, Sergei

    ISSN: 0890-5401, 1090-2651
    Published: San Diego, CA Elsevier Inc 01.05.2004
    Published in Information and computation (01.05.2004)
    “…We give a direct proof by generic reduction that testing validity of formulas in a decidable rudimentary theory Ω of finite typed sets (Henkin, Fundamenta…”
    Get full text
    Journal Article
    Save to List
    Saved in:

Search Tools: