The Resource Logic year 1979-80, the University of Connecticut, USA, edited by M. Lerman, J.H. Schmerl, and R.I. Soare
Logic year 1979-80, the University of Connecticut, USA, edited by M. Lerman, J.H. Schmerl, and R.I. Soare
Resource Information
The item Logic year 1979-80, the University of Connecticut, USA, edited by M. Lerman, J.H. Schmerl, and R.I. Soare represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.This item is available to borrow from 1 library branch.
Resource Information
The item Logic year 1979-80, the University of Connecticut, USA, edited by M. Lerman, J.H. Schmerl, and R.I. Soare represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in University of Missouri Libraries.
This item is available to borrow from 1 library branch.
- Language
- eng
- Extent
- 1 online resource (vi, 326 pages)
- Contents
-
- Definability and the hierarchy of stable theories
- QE rings in characteristic p
- Hierarchies of sets and degrees below 0?
- The plus-cupping theorem for the recursively enumerable degrees
- Natural?-RE degrees
- Elementary theory of automorphism groups of doubly homogeneous chains
- Three easy constructions of recursively enumerable sets
- On existence of?n end extensions
- Model theoretic characterizations in generalized recursion theory
- Elementarily equivalent models of power?1
- On recursive linear orderings
- The complexity of types in field theory
- The topos of types
- Some decision problems for subtheories of two-dimensional partial orderings
- Counter-examples via model completions
- High recursively enumerable degrees and the anti-cupping property
- On the Grilliot-Harrington-MacQueen theorem
- Recursively saturated, rather classless models of peano arithmetic
- The degrees of unsolvability: Global results
- Two theorems on autostability in p-Groups
- Constructive and recursive scattered order types
- Isbn
- 9783540386735
- Label
- Logic year 1979-80, the University of Connecticut, USA
- Title
- Logic year 1979-80, the University of Connecticut, USA
- Statement of responsibility
- edited by M. Lerman, J.H. Schmerl, and R.I. Soare
- Language
- eng
- Action
- digitized
- Cataloging source
- SPLNM
- Dewey number
- 511.3
- Illustrations
- illustrations
- Index
- no index present
- LC call number
-
- QA3
- QA9.A1
- LC item number
- .L28 vol. 859
- Literary form
- non fiction
- Nature of contents
-
- dictionaries
- bibliography
- http://library.link/vocab/relatedWorkOrContributorDate
-
- 1943-
- 1940-
- 1940-
- http://library.link/vocab/relatedWorkOrContributorName
-
- Lerman, M.
- Schmerl, J. H.
- Soare, R. I.
- Series statement
- Lecture notes in mathematics,
- Series volume
- 859
- http://library.link/vocab/subjectName
-
- Logic, Symbolic and mathematical
- Logique symbolique et mathématique
- Logic, Symbolic and mathematical
- Logik
- Beweistheorie
- Label
- Logic year 1979-80, the University of Connecticut, USA, edited by M. Lerman, J.H. Schmerl, and R.I. Soare
- Bibliography note
- Includes bibliographical references
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Definability and the hierarchy of stable theories -- QE rings in characteristic p -- Hierarchies of sets and degrees below 0? -- The plus-cupping theorem for the recursively enumerable degrees -- Natural?-RE degrees -- Elementary theory of automorphism groups of doubly homogeneous chains -- Three easy constructions of recursively enumerable sets -- On existence of?n end extensions -- Model theoretic characterizations in generalized recursion theory -- Elementarily equivalent models of power?1 -- On recursive linear orderings -- The complexity of types in field theory -- The topos of types -- Some decision problems for subtheories of two-dimensional partial orderings -- Counter-examples via model completions -- High recursively enumerable degrees and the anti-cupping property -- On the Grilliot-Harrington-MacQueen theorem -- Recursively saturated, rather classless models of peano arithmetic -- The degrees of unsolvability: Global results -- Two theorems on autostability in p-Groups -- Constructive and recursive scattered order types
- Control code
- 298063519
- Dimensions
- unknown
- Extent
- 1 online resource (vi, 326 pages)
- Form of item
- online
- Isbn
- 9783540386735
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other physical details
- illustrations.
- Reproduction note
- Electronic reproduction.
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)298063519
- System details
- Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
- Label
- Logic year 1979-80, the University of Connecticut, USA, edited by M. Lerman, J.H. Schmerl, and R.I. Soare
- Bibliography note
- Includes bibliographical references
- Carrier category
- online resource
- Carrier category code
-
- cr
- Carrier MARC source
- rdacarrier
- Content category
- text
- Content type code
-
- txt
- Content type MARC source
- rdacontent
- Contents
- Definability and the hierarchy of stable theories -- QE rings in characteristic p -- Hierarchies of sets and degrees below 0? -- The plus-cupping theorem for the recursively enumerable degrees -- Natural?-RE degrees -- Elementary theory of automorphism groups of doubly homogeneous chains -- Three easy constructions of recursively enumerable sets -- On existence of?n end extensions -- Model theoretic characterizations in generalized recursion theory -- Elementarily equivalent models of power?1 -- On recursive linear orderings -- The complexity of types in field theory -- The topos of types -- Some decision problems for subtheories of two-dimensional partial orderings -- Counter-examples via model completions -- High recursively enumerable degrees and the anti-cupping property -- On the Grilliot-Harrington-MacQueen theorem -- Recursively saturated, rather classless models of peano arithmetic -- The degrees of unsolvability: Global results -- Two theorems on autostability in p-Groups -- Constructive and recursive scattered order types
- Control code
- 298063519
- Dimensions
- unknown
- Extent
- 1 online resource (vi, 326 pages)
- Form of item
- online
- Isbn
- 9783540386735
- Media category
- computer
- Media MARC source
- rdamedia
- Media type code
-
- c
- Other physical details
- illustrations.
- Reproduction note
- Electronic reproduction.
- Sound
- unknown sound
- Specific material designation
- remote
- System control number
- (OCoLC)298063519
- System details
- Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002.
Library Links
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Logic-year-1979-80-the-University-of/T413yBwGyn4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Logic-year-1979-80-the-University-of/T413yBwGyn4/">Logic year 1979-80, the University of Connecticut, USA, edited by M. Lerman, J.H. Schmerl, and R.I. Soare</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data - Experimental
Data Citation of the Item Logic year 1979-80, the University of Connecticut, USA, edited by M. Lerman, J.H. Schmerl, and R.I. Soare
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa fa-external-link-square fa-fw"></i> Data from <span resource="http://link.library.missouri.edu/portal/Logic-year-1979-80-the-University-of/T413yBwGyn4/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.missouri.edu/portal/Logic-year-1979-80-the-University-of/T413yBwGyn4/">Logic year 1979-80, the University of Connecticut, USA, edited by M. Lerman, J.H. Schmerl, and R.I. Soare</a></span> - <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.missouri.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.missouri.edu/">University of Missouri Libraries</a></span></span></span></span></div>
