JSTOR Effectively Retractable Theories And Degrees Of Undecidability We identify a sentence with its Godel number so that we speak of 0 sets of . degrees OF Undecidability 601 resulting sequence of sentences, say do, d~,. http://links.jstor.org/sici?sici=0022-4812(196912)34:4<597:ERTADO>2.0.CO;2-3
03Dxx Other Turing degree structures; 03D30 Other degrees and reducibilities; 03D35 Undecidability and degrees of sets of sentences; 03D40 Word problems, etc. http://www.ams.org/msc/03Dxx.html
List For KWIC List Of MSC2000 Phrases sentences decidability of theories and sets of 03B25 sentences Undecidability and degrees of sets of 03D35 separability 54D65 http://www.math.unipd.it/~biblio/kwic/msc/m-kl_11_48.htm
Mhb03.htm 03D28, Other Turing degree structures. 03D30, Other degrees and reducibilities. 03D35, Undecidability and degrees of sets of sentences http://www.mi.imati.cnr.it/~alberto/mhb03.htm
Sachgebiete Der AMS-Klassifikation: 00-09 deductive systems 03B25 Decidability of theories and sets of sentences, reducibilities 03D35 Undecidability and degrees of sets of sentences 03D40 http://www.math.fu-berlin.de/litrech/Class/ams-00-09.html
MathNet-Mathematical Subject Classification 03D25, Recursively enumerable sets and degrees. 03D30, Other degrees; reducibilities. 03D35, Undecidability and degrees of sets of sentences http://basilo.kaist.ac.kr/API/?MIval=research_msc_1991_out&class=03-XX
HeiDOK 03D35 Undecidability and degrees of sets of sentences ( 0 Dok. ) 03D40 Word problems, etc. ( 0 Dok. ) 03D45 Theory of numerations, effectively presented http://archiv.ub.uni-heidelberg.de/volltextserver/msc_ebene3.php?zahl=03D&anzahl
DC MetaData For: Decidability Of Code Properties See also {20M35, 03D35 Undecidability and degrees of sets of sentences We explore the borderline between decidability and Undecidability of http://www.mathematik.uni-halle.de/reports/shadows/00-11report.html
J Logic Computation -- Sign In Page we shall consider not only sentences but also formulas with free .. On the structure of degrees of index sets. Algebra and Logic (1979) 18463480. http://logcom.oxfordjournals.org/cgi/content/full/exm038v1
359/369 (Total 5522) NO 152 03E04 Ordered Sets And Translate this page See also 06B25, 08A50, 20F10, 68R15. 139, 03D35, Undecidability and degrees of sets of sentences. 138, 03D30, Other degrees and reducibilities http://www.mathnet.or.kr/mathnet/msc_list.php?mode=list&ftype=&fstr=&page=359
Catálogo Translate this page Búsqueda por tema 03D35 - Undecidability and degrees of sets of sentences Martin Weese, Undecidable extensions of the theory of Boolean algebras http://catalis.uns.edu.ar/cgi-bin/catalis_pack_demo_devel/wxis?IsisScript=opac/x
0 Top The TOP Concept In The Hierarchy. 1 Adverbial Modification 308 degrees of sets of sentences 309 effectively presented structure 31 329 thue system 33 unicorn 330 Undecidability 331 word problem 332 reference The http://staff.science.uva.nl/~caterina/LoLaLi/soft/ch-data/gloss.txt
Richard A. Shore: Publications On the AEsentences of alpha-recursion theory, in Generalized Recursion Theory II, . The theories of the T, tt and wtt r.e. degrees Undecidability and http://www.math.cornell.edu/~shore/publications.html
Publication Of V.L. Selivanov On the structure of degrees of index sets. Algebra and Logic, 18, . Undecidability in the homomorphic quasiorder of finite labeled forests (joint with http://vseliv.nspu.ru/en/publ/part
Tree Structure Of LoLaLi Concept Hierarchy Updated On 2004624 330 Undecidability . . . . 328 theory of numerations . 308 degrees of sets of sentences . . . . 319 recursive equivalence type . http://remote.science.uva.nl/~caterina/LoLaLi/soft/ch-data/tree.txt
Hilary Putnam Bibliography Decidability and Essential Undecidability. Journal of Symbolic Logic 22.1 (March 1957) . degrees of Unsolvability of Constructible sets of Integers. http://www.pragmatism.org/putnam/
Springer Online Reference Works Both natural and programming languages can be viewed as sets of sentences, that is, finite strings of elements from some basic vocabulary. http://eom.springer.de/F/f040850.htm
Computability Theory Post asked whether there is an intermediate c.e. degree and this was solved by Friedberg and .. We define Rosser sentences and show their Undecidability. http://caltechmacs117b.wordpress.com/
1. Computability And Randomness Higher Randomness Notions And The theory of the polynomial manyone degrees of recursive sets is undecidable (with K.Ambos-Spies). STACS 92, Lecture Notes in Computer Science 577, http://www.cs.auckland.ac.nz/~nies/onlinepapers.html
Mathematical Preprints By Steffen Lempp The Pi3theory of the enumerable Turing degrees is undecidable, with andré Nies .. in terms of congruences and effective conjunctions of Pi01-sentences. http://www.math.wisc.edu/~lempp/papers/list.html
North Texas Logic Conference Logic, 1997 proved the Undecidability of the firstorder theory of the enumeration degrees of the 02-sets. A closer analysis of their proof shows that http://www.math.unt.edu/logic/ntlc/ntlc.html
Studia Informatica AbstractThe degree of Undecidability of nonmonotonic logic is investigated. arithmetical but not recursively enumerable sets of sentences definable by http://www.studiainformatica.ii.ap.siedlce.pl/volume.php?id=7
Olivier Finkel The stretching theorem for local sentences expresses a remarkable reflection . Undecidability of Topological and Arithmetical Properties of Infinitary http://www.logique.jussieu.fr/www.finkel
Boolos Bibliography (with Hilary Putnam) degrees of unsolvability of constructible sets of Extremely undecidable sentences. Journal of Symbolic Logic 47 (1982) 191196. http://web.mit.edu/philos/www/facultybibs/boolos_bib.html
Sentence Modeling And Parsing Parsing is the process of discovering analyses of sentences, that is, consistent sets of relationships between constituents that are judged to hold in a http://cslu.cse.ogi.edu/HLTsurvey/ch3node8.html
Computability Complexity Logic Book Reduction concepts and degrees of unsolvability. 114 Reduction concepts (theorem of Post), index sets (theorem of Rice and Shapiro, Sncomplete program http://www.di.unipi.it/~boerger/cclbookcontents.html
Annals Of Pure And Applied Logic Decidable and undecidable prime theories in infinitevalued logic On Sigma1 and Pi1 sentences and degrees of Interpretability. by Per Lindström v. http://wotan.liu.edu/docis/dbl/apuapl/index.html
DBLP: André Nies 2 Klaus AmbosSpies, André Nies The Theory of the Polynomial Many-One degrees of Recursive sets is Undecidable. STACS 1992 209-218 http://www.informatik.uni-trier.de/~ley/db/indices/a-tree/n/Nies:Andr=eacute=.ht
Publications - Timothy Hinrichs Logicians frequently use axiom schemata to encode (potentially infinite) sets of sentences with particular syntactic form. In this paper we examine a http://logic.stanford.edu/~thinrich/publications.htm
Logic Colloquium 2003 Older results typically showed the two quantifier level decidable and the third undecidable. We examine the situation for the r.e. degrees, the degrees http://www.helsinki.fi/lc2003/titles.html
Atlas: Victoria International Conference 2004 - Abstracts The set of Krandom strings has long been known to be undecidable. It is shown that the Turing degrees of Schnorr-random sets are those of Martin-Loef http://atlas-conferences.com/cgi-bin/abstract/select/camo-01?session=1
Abstracts Additionally, we consider the complexity of sets of formulae naturally defined in finite models. We state that the set of sentences true in almost all http://www.impan.gov.pl/~kz/Abstracts.html
Lawrence S. Moss: Articles The Undecidability of Iterated Modal Relativization, with Joseph S. Miller Traditional syllogisms involve sentences of the following simple forms All X http://www.indiana.edu/~iulg/moss/aarticles.htm
AUTHOR INDEX Single matrices for the operations of both types contain two sets of designated values one of possible values (degrees of truth) for the premisses, http://www.filozof.uni.lodz.pl/bulletin/v331.html
All About Oscar The theory had the revolutionary aspect of treating infinite sets as Thus, the existence of undecidable sentences in each such theory points out an http://www.britannica.com/oscar/print?articleId=109532&fullArticle=true&tocId=24
M. E. Szabo: The Collected Works Of Gerhard Gentzen In this context he constructs an infinite set of sentences that has no . This refers to a small portion of Godel s 1931 paper on Undecidability. http://mathgate.info/cebrown/notes/szabo.php
2007-08 UCI Catalogue: Social Sciences Introduction to sentence logic, including truth tables and natural deduction; . 205C Undecidability and Incompleteness (4). Formal theory of effective http://www.editor.uci.edu/07-08/ss/ss.10.htm
Peter Suber, "Non-Standard Logics" Would it be interesting to make these sets undecidable? Logics that deal with the truth of conditional sentences, particularly in the subjunctive mood. http://www.earlham.edu/~peters/courses/logsys/nonstbib.htm
Godel's Theorem@Everything2.com It proved difficult to construct a theory of sets which outruled such objects . To prove that an undecidable sentence existed, Godel needed to find a http://everything2.com/index.pl?node_id=23136
EULER Record Details Of course $\cup$ is definable in ${\cal D}$, but many interesting degreetheoretic results are expressible as $\Sigma_2$-sentences in the language of ${\cal http://www.emis.de/projects/EULER/detail?ide=1993jocksigm2theuppe&matchno=11&mat
George Boolos - Wikipedia, The Free Encyclopedia 1982, Extremely undecidable sentences, Journal of Symbolic Logic 47 191196. 1987c (with Vann McGee), The degree of the set of sentences of http://en.wikipedia.org/wiki/George_Boolos
ICALP'07: Accepted Papers - Track B The Undecidability result holds also for the simulation of twolabel BPP processes. . bound on the length of the local sentence in terms of the original. http://icalp07.ii.uni.wroc.pl/acceptl-trackb.html
FOM: Midwest Model Theory Meeting Another way to look at this is to look at the Pi0-1 sentence. There is an old theorem of mine about Undecidability in dynamics of semilinear maps that http://cs.nyu.edu/pipermail/fom/1999-November/003475.html
Abstracts For Publications Of Prof. J. Maurice Rojas Computational Arithmetic Geometry I sentences Nearly in the Polynomial We consider the averagecase complexity of some otherwise undecidable or open http://www.math.tamu.edu/~rojas/abstracts.html
Information Typically, one points to the sentence This statement is unprovable as an leads to a logical contradiction (a formally undecidable proposition?). http://serendip.brynmawr.edu/local/scisoc/information/1july04.html