pular para conteúdo
New proofs of old theorems in logic and formal linguistics. Ver prévia deste item
FecharVer prévia deste item
Checando...

New proofs of old theorems in logic and formal linguistics.

Autor: Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
Editora: Ft. Belvoir Defense Technical Information Center NOV 1966.
Edição/Formato   Print book : InglêsVer todas as edições e formatos
Base de Dados:WorldCat
Resumo:
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  Ler mais...
Classificação:

(ainda não classificado) 0 com críticas - Seja o primeiro.

Assuntos
Mais como este

 

Encontrar uma cópia na biblioteca

&AllPage.SpinnerRetrieving; Encontrando bibliotecas que possuem este item...

Detalhes

Tipo de Documento: Livro
Todos os Autores / Contribuintes: Robert W Floyd; CARNEGIE INST OF TECH PITTSBURGH PA.
Número OCLC: 227469361
Notas: Prepared in cooperation with Computer Associates, Inc., Auburn, Mass., Contract AF 30(602)-3342.
Descrição: 19 pages

Resumo:

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).

Críticas

Críticas contribuídas por usuários
Recuperando críticas GoodReas...
Recuperando comentários DOGObooks

Etiquetas

Seja o primeiro.

Ítens Similares

Assuntos Relacionados:(4)

Confirmar esta solicitação

Você já pode ter solicitado este item. Por favor, selecione Ok se gostaria de proceder com esta solicitação de qualquer forma.

Dados Ligados


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://experiment.worldcat.org/entity/work/data/47434171#Person/floyd_robert_w> ; # 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#Person/floyd_robert_w> # Robert W. Floyd
    a schema:Person ;
    schema:familyName "Floyd" ;
    schema:givenName "Robert W." ;
    schema:name "Robert W. Floyd" ;
    .

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


Content-negotiable representations

Close Window

Por favor, conecte-se ao WorldCat 

Não tem uma conta? Você pode facilmente criar uma conta gratuita.