MARC

LEADER 00000cam a2200000Mu 4500
001 EBOOKCENTRAL_ocn990408323
003 OCoLC
005 20240329122006.0
006 m d
007 cr |||||||||||
008 151005s1990 riu o 000 0 eng d
040 |a LIP  |b eng  |c LIP  |d EBLCP  |d OCLCO  |d OCLCF  |d AU@  |d OCLCQ  |d WAU  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCQ  |d OCLCO  |d OCLCL 
019 |a 922980400 
020 |a 0821851101 
020 |a 9780821851104 
020 |a 9780821876947 
020 |a 0821876945 
029 1 |a AU@  |b 000069468848 
035 |a (OCoLC)990408323  |z (OCoLC)922980400 
050 4 |a QA9.59 ǂb .W67 1987eb 
082 0 4 |a 511.3 
049 |a UAMI 
111 2 |a Workshop on Logic and Computation  |d (1987 :  |c Carnegie Mellon University) 
245 1 0 |a Logic and Computation  |h [electronic resource]. 
246 3 |a Contemporary Mathematics 
246 3 |a Contemporary Mathematics, Volume 106 
246 3 |a Logic and computation: proceedings of a workshop held at Carnegie Mellon University, June 30-July 2, 1987 
260 |a Providence :  |b American Mathematical Society,  |c 1990. 
300 |a 1 online resource (314 p.) 
336 |a text  |b txt 
337 |a computer  |b c 
338 |a online resource  |b cr 
490 1 |a Contemporary Mathematics ;  |v v.106 
500 |a Description based upon print version of record. 
505 0 |a ""Contents""; ""Preface""; ""Some theories conservative over intuitionistic arithmetic""; ""Ramsey interpreted: A parametric version of Ramsey's theorem""; ""Notions of closed subsets of a complete separable metric space in weak subsystems of second order arithmetic""; ""A note on polynomial time computable arithmetic""; ""Axiomatizations and conservation results for fragments of bounded arithmetic""; ""A smash-based hierarchy between PTIME and PSPACE""; ""Polymorphic typed lambda-calculi in a type-free axiomatic framework""; ""Polynomial time computable arithmetic"" 
505 8 |a ""Metaprogramming in SIL""""W K Lo and orderings of countable abelian groups""; ""Marriage theorems and reverse mathematics""; ""Computationally based set existence principles""; ""Hierarchy results for mixed-time""; ""Polynomial time equivalence types""; ""Program development through proof transformation""; ""Some models of Scott's theory LC F based on a notion of rate of convergence""; ""Sharply bounded arithmetic and the function a -1""; ""Radon-nikodym theorem is equivalent to arithmetical comprehension"" 
546 |a English. 
590 |a ProQuest Ebook Central  |b Ebook Central Academic Complete 
650 0 |a Computable functions  |x Data processing  |v Congresses. 
650 6 |a Fonctions calculables  |x Informatique  |v Congrès. 
650 7 |a Computable functions  |x Data processing  |2 fast 
650 7 |a Mathematics.  |2 hilcc 
650 7 |a Physical Sciences & Mathematics.  |2 hilcc 
650 7 |a Mathematical Theory.  |2 hilcc 
655 7 |a proceedings (reports)  |2 aat 
655 7 |a Conference papers and proceedings  |2 fast 
655 7 |a Conference papers and proceedings.  |2 lcgft 
655 7 |a Actes de congrès.  |2 rvmgf 
700 1 |a Sieg, Wilfried,  |d 1945-  |e editor.  |1 https://id.oclc.org/worldcat/entity/E39PBJjCPJhcdkDhkbrttfY773 
758 |i has work:  |a Logic and Computation (Text)  |1 https://id.oclc.org/worldcat/entity/E39PCGhJffFk6jQmcfvr6ycH83  |4 https://id.oclc.org/worldcat/ontology/hasWork 
776 0 8 |i Print version:  |t Logic and Computation.  |d Providence : American Mathematical Society, ©1990  |z 9780821851104 
830 0 |a Contemporary Mathematics. 
856 4 0 |u https://ebookcentral.uam.elogim.com/lib/uam-ebooks/detail.action?docID=3112895  |z Texto completo 
938 |a ProQuest Ebook Central  |b EBLB  |n EBL3112895 
994 |a 92  |b IZTAP