aller au contenu
New proofs of old theorems in logic and formal linguistics. Aperçu de cet ouvrage
FermerAperçu de cet ouvrage
Vérifiant…

New proofs of old theorems in logic and formal linguistics.

Auteur : Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
Éditeur: Ft. Belvoir Defense Technical Information Center NOV 1966.
Édition/format:   Livre imprimé : AnglaisVoir toutes les éditions et tous les formats
Résumé:
Theorem 1 constructs, from any word problem in a semi-Thue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other  Lire la suite...
Évaluation:

(pas encore évalué) 0 avec des critiques - Soyez le premier.

Sujets
Plus comme ceci

 

Trouver un exemplaire dans la bibliothèque

&AllPage.SpinnerRetrieving; Recherche de bibliothèques qui possèdent cet ouvrage...

Détails

Type de document: Livre
Tous les auteurs / collaborateurs: Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
Numéro OCLC: 227469361
Notes: Prepared in cooperation with Computer Associates, Inc., Auburn, Mass., Contract AF 30(602)-3342.
Description: 19 pages

Résumé:

Theorem 1 constructs, from any word problem in a semi-Thue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other standard undecidability results on phrase structure grammars are implied.) Theorem 3 constructs, from any word problem in a semi-Thue system, an ambiguity problem, combining the results of Theorem 1 and 2 by more direct means. No new results are presented, but standard proofs were shortened and constructions eliminated, combined, or simplified. (Author).

Critiques

Critiques d’utilisateurs
Récupération des critiques de GoodReads...
Récuperation des critiques DOGObooks…

Marqueurs

Soyez le premier.

Ouvrages semblables

Confirmez cette demande

Vous avez peut-être déjà demandé cet ouvrage. Veuillez sélectionner OK si vous voulez poursuivre avec cette demande quand même.

Données liées


Primary Entity

<http://www.worldcat.org/oclc/227469361> # New proofs of old theorems in logic and formal linguistics.
    a schema:Book, schema:CreativeWork ;
   library:oclcnum "227469361" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/vau> ;
   library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/47434171#Place/ft_belvoir> ; # Ft. Belvoir
   schema:about <http://experiment.worldcat.org/entity/work/data/47434171#Topic/linguistics> ; # Linguistics
   schema:about <http://experiment.worldcat.org/entity/work/data/47434171#Topic/theorems> ; # Theorems)
   schema:about <http://experiment.worldcat.org/entity/work/data/47434171#Topic/grammars> ; # Grammars
   schema:bookFormat bgn:PrintBook ;
   schema:contributor <http://experiment.worldcat.org/entity/work/data/47434171#Organization/carnegie_inst_of_tech_pittsburgh_pa> ; # CARNEGIE INST OF TECH PITTSBURGH PA.
   schema:contributor <http://viaf.org/viaf/9939181> ; # Robert W. Floyd
   schema:datePublished "NOV 1966" ;
   schema:datePublished "1966" ;
   schema:description "Theorem 1 constructs, from any word problem in a semi-Thue system, an equivalent Post correspondence problem, showing the undecidability of the general Post correspondence problem. Theorem 2 constructs, from any Post correspondence problem, a minimal linear grammar which is ambiguous exactly if the Post correspondence problem has a solution, showing the undecidability of the general ambiguity problem. (Other standard undecidability results on phrase structure grammars are implied.) Theorem 3 constructs, from any word problem in a semi-Thue system, an ambiguity problem, combining the results of Theorem 1 and 2 by more direct means. No new results are presented, but standard proofs were shortened and constructions eliminated, combined, or simplified. (Author)."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/47434171> ;
   schema:inLanguage "en" ;
   schema:name "New proofs of old theorems in logic and formal linguistics."@en ;
   schema:productID "227469361" ;
   schema:publication <http://www.worldcat.org/title/-/oclc/227469361#PublicationEvent/ft_belvoirdefense_technical_information_centernov_1966> ;
   schema:publisher <http://experiment.worldcat.org/entity/work/data/47434171#Agent/defense_technical_information_center> ; # Defense Technical Information Center
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/227469361> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/47434171#Agent/defense_technical_information_center> # Defense Technical Information Center
    a bgn:Agent ;
   schema:name "Defense Technical Information Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/47434171#Organization/carnegie_inst_of_tech_pittsburgh_pa> # CARNEGIE INST OF TECH PITTSBURGH PA.
    a schema:Organization ;
   schema:name "CARNEGIE INST OF TECH PITTSBURGH PA." ;
    .

<http://experiment.worldcat.org/entity/work/data/47434171#Topic/linguistics> # Linguistics
    a schema:Intangible ;
   schema:name "Linguistics"@en ;
   schema:name "(Linguistics"@en ;
    .

<http://viaf.org/viaf/9939181> # Robert W. Floyd
    a schema:Person ;
   schema:familyName "Floyd" ;
   schema:givenName "Robert W." ;
   schema:name "Robert W. Floyd" ;
    .


Content-negotiable representations

Fermer la fenêtre

Veuillez vous identifier dans WorldCat 

Vous n’avez pas de compte? Vous pouvez facilement créer un compte gratuit.