Movatterモバイル変換


[0]ホーム

URL:


PhilPapersPhilPeoplePhilArchivePhilEventsPhilJobs
Order:

1 filter applied
Disambiguations
Stål O. Aanderaa [3]Stål Aanderaa [2]
  1.  265
    Linear sampling and the ∀∃∀ case of the decision problem.Stal O. Aanderaa &Harry R. Lewis -1974 -Journal of Symbolic Logic 39 (3):519-548.
  2.  245
    The finite controllability of the Maslov case.Stål Aanderaa &Warren D. Goldfarb -1974 -Journal of Symbolic Logic 39 (3):509-518.
  3.  98
    Conservative reduction classes of Krom formulas.Stål O. Aanderaa,Egon Börger &Harry R. Lewis -1982 -Journal of Symbolic Logic 47 (1):110-130.
    A Krom formula of pure quantification theory is a formula in conjunctive normal form such that each conjunct is a disjunction of at most two atomic formulas or negations of atomic formulas. Every class of Krom formulas that is determined by the form of their quantifier prefixes and which is known to have an unsolvable decision problem for satisfiability is here shown to be a conservative reduction class. Therefore both the general satisfiability problem, and the problem of satisfiability in finite (...) models, can be effectively reduced from arbitrary formulas to Krom formulas of these several prefix types. (shrink)
    Direct download(7 more)  
     
    Export citation  
     
    Bookmark  
  4.  70
    Decision problems for tag systems.Stål Aanderaa &Dag Belsnes -1971 -Journal of Symbolic Logic 36 (2):229-239.
  5.  91
    Prefix classes of Krom formulas.Stål O. Aanderaa &Harry R. Lewis -1973 -Journal of Symbolic Logic 38 (4):628-642.
Export
Limit to items.
Filters





Configure languageshere.Sign in to use this feature.

Viewing options


Open Category Editor
Off-campus access
Using PhilPapers from home?

Create an account to enable off-campus access through your institution's proxy server or OpenAthens.


[8]ページ先頭

©2009-2025 Movatter.jp