Loading
Error: Cannot Load Popup Box
Skip to hit list
Adjust your hit list
Further result pages
Mobile

A
A
A

A

English
Deutsch
Français
Español
Polski
Ελληνικά
Українська
中文
 Logged in as

Log Out

Login
BASIC
SEARCH
ADVANCED
SEARCH
HELP
BROWSING
SEARCH
HISTORY
Your search
Search For:
Entire Document
Title
Author
Subject
Boost open access documents
Find
Linguistics tools
Verbatim search
Additional word forms
Multilingual synonyms
Statistics
45 hits
in 72,227,055 documents
in 0.23 seconds
Please leave the following field blank:
Home
»
Search: Wilfried Buchholz
Hit List
Hit list
1.
Bar Recursive Encodings of Tree Ordinals
Open Access
Title:
Bar Recursive Encodings of Tree Ordinals
Author:
Marc Bezem
;
Wilfried Buchholz
Marc Bezem
;
Wilfried Buchholz
Minimize authors
Description:
this paper are. It should be remarked that we are only using bar recursion of lowest type. It is not obvious how the generalization to bar recursion of higher type should be done. For metamathematical reasons the overall limitation of such generalizations is given by the (largely unknown) socalled ordinal of analysis, i.e. the ordinal which is ...
this paper are. It should be remarked that we are only using bar recursion of lowest type. It is not obvious how the generalization to bar recursion of higher type should be done. For metamathematical reasons the overall limitation of such generalizations is given by the (largely unknown) socalled ordinal of analysis, i.e. the ordinal which is related to analysis in the same way as " 0 is related to arithmetic. Most of the material presented in this paper can be found elsewhere in the literature, though sometimes in a different presentation. A paper which is particularly close to ours is Vogel [14], which came to our notice only in the final stage of the completion of this paper. We have tried to give proper credits and adequate references. 2. Preliminaries
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090411
Source:
ftp://ftp.phil.ruu.nl/logic/PREPRINTS/preprint68.ps.Z
ftp://ftp.phil.ruu.nl/logic/PREPRINTS/preprint68.ps.Z
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.5262
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.45.5262
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
2.
ProofTheoretic Analysis of Termination Proofs
Open Access
Title:
ProofTheoretic Analysis of Termination Proofs
Author:
Wilfried Buchholz
Wilfried Buchholz
Minimize authors
Description:
Introduction In [Cichon 1990] the question has been discussed (and investigated) whether the order type of a termination ordering places a bound on the lengths of reduction sequences in rewrite systems reducing under . It was claimed that at least in the cases of the recursive path ordering rpo and the lexicographic path ordering lpo the followi...
Introduction In [Cichon 1990] the question has been discussed (and investigated) whether the order type of a termination ordering places a bound on the lengths of reduction sequences in rewrite systems reducing under . It was claimed that at least in the cases of the recursive path ordering rpo and the lexicographic path ordering lpo the following theorem holds. (0) If is the order type of a termination ordering for a nite rewrite system R then the function G from the SlowGrowing Hierarchy bounds the lengths of reduction sequences in R. From (0) together with Girard's Hierarchy Comparison Theorem one derives (I) If the rules of a nite rewrite system R are reducing under rpo then the lengths of reduction sequences in R are bounded by some primitive recursive function. (II) If the rules of a nite rewrite system R are reducing under lpo then the lengths of reduction sequences in R are bounded by some function F from the fastgrowing hierarchy below ! . Unfort
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090418
Source:
http://www.mathematik.unimuenchen.de/~
buchholz
/articles/ppc94a.ps.gz
http://www.mathematik.unimuenchen.de/~
buchholz
/articles/ppc94a.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.8634
http://www.mathematik.unimuenchen.de/~buchholz/articles/ppc94a.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.8634
http://www.mathematik.unimuenchen.de/~buchholz/articles/ppc94a.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
3.
Dedicated to Wolfram Pohlers on his retirement
Open Access
Title:
Dedicated to Wolfram Pohlers on his retirement
Author:
Wilfried Buchholz
Wilfried Buchholz
Minimize authors
Description:
One of the major problems in reductive proof theory in the early 1970s was to give a prooftheoretic reduction of classical theories of iterated arithmetical inductive definitions to corresponding constructive systems. This problem was solved in [BFPS] in various ways which all where based on the method of cutelimination (normalization, reps.) ...
One of the major problems in reductive proof theory in the early 1970s was to give a prooftheoretic reduction of classical theories of iterated arithmetical inductive definitions to corresponding constructive systems. This problem was solved in [BFPS] in various ways which all where based on the method of cutelimination (normalization, reps.) for infinitary Taitstyle sequent calculi (infinitary systems of natural deduction
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20120201
Source:
http://www.mathematik.unimuenchen.de/~
buchholz
/
buchholz
_neu.pdf
http://www.mathematik.unimuenchen.de/~
buchholz
/
buchholz
_neu.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.210.4556
http://www.mathematik.unimuenchen.de/~buchholz/buchholz_neu.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.210.4556
http://www.mathematik.unimuenchen.de/~buchholz/buchholz_neu.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
4.
Bar recursive encodings of tree ordinals
Open Access
Title:
Bar recursive encodings of tree ordinals
Author:
Marc Bezem
;
Wilfried Buchholz
Marc Bezem
;
Wilfried Buchholz
Minimize authors
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20131122
Source:
http://www.phil.uu.nl/preprints/lgps/authors/bezem/barrecursiveencodingsoftreeordinals/pdf/
http://www.phil.uu.nl/preprints/lgps/authors/bezem/barrecursiveencodingsoftreeordinals/pdf/
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.1418
http://www.phil.uu.nl/preprints/lgps/authors/bezem/barrecursiveencodingsoftreeordinals/pdf/
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.1418
http://www.phil.uu.nl/preprints/lgps/authors/bezem/barrecursiveencodingsoftreeordinals/pdf/
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
5.
Relating Ordinals to Proofs in a Perspicious Way
Open Access
Title:
Relating Ordinals to Proofs in a Perspicious Way
Author:
Wilfried Buchholz
Wilfried Buchholz
Minimize authors
Description:
this paper, we omit it here. (a) Let c = D c 0 c 1 ::: cm , a = D a 0 a 1 ::: an with principal terms c 1 ; :::; c m ; a 1 ; :::; an . 1. < : From c m : : : c 1 D c 0 we get by IH o(c m ) : : : o(c 1 ) o(D c 0 ) = o(c 0 ) < +1 and thus o(c) < +1 o(D a 0 ) o(a). 2. = and c 0 a 0 : By IH o(c 0 ) < o(a 0 ). Since D c 0 2 OT, we have G c 0 c 0 and t...
this paper, we omit it here. (a) Let c = D c 0 c 1 ::: cm , a = D a 0 a 1 ::: an with principal terms c 1 ; :::; c m ; a 1 ; :::; an . 1. < : From c m : : : c 1 D c 0 we get by IH o(c m ) : : : o(c 1 ) o(D c 0 ) = o(c 0 ) < +1 and thus o(c) < +1 o(D a 0 ) o(a). 2. = and c 0 a 0 : By IH o(c 0 ) < o(a 0 ). Since D c 0 2 OT, we have G c 0 c 0 and thus by IH o(c 0 ) 2 C(o(c 0 ); o(c 0 )). Hence o(c 0 ) < o(a 0 ) by Theorem 1.2(c). Now o(c) o(a) follows as in 1. (using that o(a) is additively closed). 3. = & c 0 = a 0 & c 1 ::: cm a 1 ::: an : Immediate by IH. (b) 1. c = c 0 ::: c k 1 with k 6= 1: Then G c i a and thus (by IH) o(c i ) 2 C := C(o(a); o(a)) for i < k
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20090416
Source:
http://www.mathematik.unimuenchen.de/~
buchholz
/articles/f7june.ps.gz
http://www.mathematik.unimuenchen.de/~
buchholz
/articles/f7june.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.8875
http://www.mathematik.unimuenchen.de/~buchholz/articles/f7june.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.8875
http://www.mathematik.unimuenchen.de/~buchholz/articles/f7june.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
6.
Dedicated to Wolfram Pohlers on his retirement
Open Access
Title:
Dedicated to Wolfram Pohlers on his retirement
Author:
Wilfried Buchholz
Wilfried Buchholz
Minimize authors
Description:
One of the major problems in reductive proof theory in the early 1970s was to give a prooftheoretic reduction of classical theories of iterated arithmetical inductive definitions to corresponding constructive systems. This problem was solved in [BFPS] in various ways which all where based on the method of cutelimination (normalization, reps.) ...
One of the major problems in reductive proof theory in the early 1970s was to give a prooftheoretic reduction of classical theories of iterated arithmetical inductive definitions to corresponding constructive systems. This problem was solved in [BFPS] in various ways which all where based on the method of cutelimination (normalization, reps.) for infinitary Taitstyle sequent calculi (infinitary systems of natural deduction, resp.).
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20120319
Source:
http://wwwmath.unimuenster.de/logik/Personen/rds/pohlers_volume/
buchholz
.pdf
http://wwwmath.unimuenster.de/logik/Personen/rds/pohlers_volume/
buchholz
.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.6483
http://wwwmath.unimuenster.de/logik/Personen/rds/pohlers_volume/buchholz.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.215.6483
http://wwwmath.unimuenster.de/logik/Personen/rds/pohlers_volume/buchholz.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
7.
A note on SLDNFresolution
Open Access
Title:
A note on SLDNFresolution
Author:
Wilfried Buchholz Mathematisches
Wilfried Buchholz Mathematisches
Minimize authors
Description:
1 Introduction In this paper, starting from Definition 8.8 in [3], we design a new (and as it seems to us rather compact and elegant) notion of SLDNFtree together with the appropriate definition of fairness such that the following "strong completeness theorem " can be established: Theorem Let S be an input/output specification, P an Scorrect l...
1 Introduction In this paper, starting from Definition 8.8 in [3], we design a new (and as it seems to us rather compact and elegant) notion of SLDNFtree together with the appropriate definition of fairness such that the following "strong completeness theorem " can be established: Theorem Let S be an input/output specification, P an Scorrect logic program, T a fair SLDNFtree for G w.r.t. P.
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://www.mathematik.unimuenchen.de/~
buchholz
/articles/sldlapre.ps.gz
http://www.mathematik.unimuenchen.de/~
buchholz
/articles/sldlapre.ps.gz
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.3293
http://www.mathematik.unimuenchen.de/~buchholz/articles/sldlapre.ps.gz
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.69.3293
http://www.mathematik.unimuenchen.de/~buchholz/articles/sldlapre.ps.gz
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
8.
Re ned Program Extraction from Classical Proofs
Open Access
Title:
Re ned Program Extraction from Classical Proofs
Author:
Ulrich Berger
;
Wilfried Buchholz
;
Helmut Schwichtenberg
Ulrich Berger
;
Wilfried Buchholz
;
Helmut Schwichtenberg
Minimize authors
Description:
It is well known that it is undecidable in general whether a given program meets its speci cation. In contrast, it can be checked easily by amachine whether a formal proof is correct, and from a constructive proof one can automatically
It is well known that it is undecidable in general whether a given program meets its speci cation. In contrast, it can be checked easily by amachine whether a formal proof is correct, and from a constructive proof one can automatically
Minimize
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20080701
Source:
http://www.cs.swan.ac.uk/reports/yr2002/CSR142002.pdf
http://www.cs.swan.ac.uk/reports/yr2002/CSR142002.pdf
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.3277
http://www.cs.swan.ac.uk/reports/yr2002/CSR142002.pdf
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.103.3277
http://www.cs.swan.ac.uk/reports/yr2002/CSR142002.pdf
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
9.
Refined Program Extraction from Classical Proofs
Open Access
Title:
Refined Program Extraction from Classical Proofs
Author:
Ulrich Berger
;
Wilfried Buchholz
;
Helmut Schwichtenberg
Ulrich Berger
;
Wilfried Buchholz
;
Helmut Schwichtenberg
Minimize authors
Publisher:
Springer Verlag
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20140225
Source:
http://www.mathematik.unimuenchen.de/~schwicht/papers/troelstra00/rpe4.ps.Z
http://www.mathematik.unimuenchen.de/~schwicht/papers/troelstra00/rpe4.ps.Z
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.756
http://www.mathematik.unimuenchen.de/~schwicht/papers/troelstra00/rpe4.ps.Z
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.756
http://www.mathematik.unimuenchen.de/~schwicht/papers/troelstra00/rpe4.ps.Z
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
10.
Refined program extraction from classical proofs
Open Access
Title:
Refined program extraction from classical proofs
Author:
Ulrich Berger
;
Wilfried Buchholz
;
Helmut Schwichtenberg
Ulrich Berger
;
Wilfried Buchholz
;
Helmut Schwichtenberg
Minimize authors
Contributors:
The Pennsylvania State University CiteSeerX Archives
Year of Publication:
20140225
Source:
http://www.mathematik.unimuenchen.de/~schwicht/papers/troelstra00/rpe5.ps
http://www.mathematik.unimuenchen.de/~schwicht/papers/troelstra00/rpe5.ps
Minimize
Document Type:
text
Language:
en
Rights:
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Metadata may be used without restrictions as long as the oai identifier remains attached to it.
Minimize
URL:
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.1052
http://www.mathematik.unimuenchen.de/~schwicht/papers/troelstra00/rpe5.ps
http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.132.1052
http://www.mathematik.unimuenchen.de/~schwicht/papers/troelstra00/rpe5.ps
Minimize
Content Provider:
CiteSeerX
My Lists:
My Tags:
Notes:
Detail View
Email this
Export Record
Export Record
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Add to Favorites
Check in Google Scholar
Add to another List
Edit Favorit
Delete from Favorites
Export Record
All Records
Export
» RefWorks
» EndNote
» RIS
» BibTeX
» MARC
» RDF
» RTF
» JSON
» YAML
Adjust your hit list
Sort Your Results
Refine Search Result
More Options
Sort Your Results
Sort by:
Relevance
Author, ZA
Author, AZ
Title, AZ
Title, ZA
Date of publication, descending
Date of publication, ascending
Refine Search Result
Author
(23) Buchholz, Wilfried
(14) The Pennsylvania State University CiteSeerX...
(10) Wilfried Buchholz
(4) Helmut Schwichtenberg
(4) Ulrich Berger
(3) Broll, Susanne
(3) Buchholz, Udo
(3) Hellenbrand, Wiebke
(3) Hopp, Wilfried
(3) Kimmig, Peter
(3) Lunemann, Mechthild
(3) Porten, Klaudia
(3) Rissland, Jürgen
(3) Schütte, K.
(3) Tigges, Almira
(3) WagnerWiening, Christiane
(3) van Treeck, Ulrich
(2) Brockmann, Stefan O
(2) Marc Bezem
(1) Aczel, Peter
(1) BUCHHOLZ, WILFRIED
(1) BargKues, Brigitte
(1) Berichterstatter Wilfried Buchholz
(1) Bibliogra Information
(1) Brockmann Stefan O
(1) Brockmann, Stefan
(1) Broll Susanne
(1) Buchholz Udo
(1) Buchholz, A.
(1) Buchholz, Oda
(1) Buchholz, Thomas
(1) C Harland Media
(1) Cichon, A.
(1) Cornejo Barrera
(1) Cornejo Barrera Acknowledgments
(1) Der Deutschen Bibliothek
(1) Diller, Justus
(1) Doktorvater Prof
(1) Dr. Wilfried Buchholz
(1) Dritter Berichterstatter
(1) Engler, Siegfried
(1) Fiedler, Wilfried
(1) García Arellano
(1) Grabundzija, Ivana
(1) Grebe, Antonia
(1) H. Schwichtenberg
(1) Hall, Vanessa Jane
(1) Haridoss, Srividiameena
(1) Hellenbrand Wiebke
(1) Helmutschwichtenberg B
(1) Herrmann, Doris
(1) Hopp Wilfried
(1) Hyttel, Poul
(1) Ivics, Zoltan
(1) Kimmig Peter
(1) Klaus Aehlig
(1) Kues, Wilfried A.
(1) Ludwigmaximiliansuniversität München
(1) Lunemann Mechthild
(1) Martin, Ulrich
(1) Merkert, Sylvia
(1) My Julia
(1) My Lucía
(1) My Parménides
(1) Müller, Gert Heinz
(1) Niemann, Heiner
(1) NowakImialek, Monika
(1) Oikonen, Väänänen
(1) Pohlers, W.
(1) Porten Klaudia
(1) Prof Dr
(1) Rasmussen, Mikkel Aabech
(1) Rissland Jrgen
(1) Schmitz, Wilfried
(1) Sieg, W.
(1) Simmons, Harold
(1) Simpson, Stephen G.
(1) Streeck, Miriam
(1) Tigges Almira
(1) Ulrich Berger A
(1) Von Parménides García Cornejo
(1) W. Pohlers
(1) WagnerWiening Christiane
(1) Wainer, S.
(1) Wainer, Stanley S.
(1) Weiermann, A.
(1) Wilfried Buchholz B
(1) Wilfried Buchholz Mathematisches
(1) Zweiter Berichterstatter
(1) van Treeck Ulrich
Author:
Subject
(16) ddc 510
(16) mathematik
(10) informatik und statistik
(2) 510 mathematics
(2) animals
(1) 18 07 2003
(1) adolescent
(1) adult
(1) age distribution
(1) aged
(1) aged 80 and over
(1) antigens
(1) articles
(1) cell transformation
(1) cells
(1) child
(1) coculture techniques
(1) cultured
(1) ddc 610
(1) differentiation
(1) disease outbreaks
(1) dna transposable elements
(1) doaj health sciences
(1) doaj internal medicine
(1) doaj medicine general
(1) female
(1) fibroblasts
(1) fluorescence
(1) general linguistics
(1) genetic
(1) germany epidemiology
(1) gheg albanian language
(1) green fluorescent proteins
(1) humans
(1) induced pluripotent stem cells
(1) lcc internal medicine
(1) lcc medicine
(1) lcc r
(1) lcc rc31 1245
(1) male
(1) mathematica
(1) medizin
(1) mice
(1) microscopy
(1) middle aged
(1) neoplastic
(1) neurogenesis
(1) nude
(1) octamer transcription factor 3
(1) preschool
(1) promoter regions
(1) q fever epidemiology
(1) q fever transmission
(1) q fever veterinary
(1) research article
(1) risk factors
(1) semantics
(1) sex distribution
(1) sheep diseases transmission
(1) sheep microbiology
(1) soxb1 transcription factors
(1) sus scrofa
(1) syntax
(1) tag des rigorosums
(1) teratoma
(1) tosk albanian language
(1) transcriptome
(1) transgenes
(1) typology
(1) zoonoses epidemiology
(1) zoonoses transmission
Subject:
Dewey Decimal Classification (DDC)
(3) Agriculture [63*]
(1) Life sciences; biology [57*]
(1) Medicine & health [61*]
Dewey Decimal Classification (DDC):
Year of Publication
(5) 2009
(4) 1975
(4) 2006
(3) 1987
(3) 2008
(3) 2012
(2) 1976
(2) 1991
(2) 1994
(2) 2013
(2) 2014
(1) 1977
(1) 1978
(1) 1980
(1) 1983
(1) 1985
(1) 1986
(1) 1988
(1) 1990
(1) 1992
(1) 1993
(1) 1996
(1) 1998
(1) 2000
Year of Publication:
Content Provider
(16) Munich LMU: Open Access
(14) CiteSeerX
(4) Project Euclid
(2) DigiZeitschriften
(1) BioMed Central
(1) Copenhagen Univ.: CURIS
(1) DOAJ Articles
(1) Göttingen Center for Retrospective Digitization...
(1) HighWire Press
(1) OLAC
(1) PubMed Central
(1) Robert Koch Institute: Publications
(1) Aachen RWTH: Publications
Content Provider:
Language
(27) English
(17) Unknown
(1) Dutch; Flemish
Language:
Document Type
(24) Text
(14) Article, Journals
(7) Books
Document Type:
Access
(26) Unknown
(19) Open Access
Access:
More Options
»
Search History
»
Get RSS Feed
»
Get ATOM Feed
»
Email this Search
»
Save Search
»
Browsing
»
Search Plugin
Further result pages
Results:
1

2

3

4

5
Next »
New Search »
Currently in BASE: 72,227,055 Documents of 3,466
Content Sources
About BASE

Contact

BASE Lab

Imprint
© 20042015 by
Bielefeld University Library
Search powered by
Solr
&
VuFind
.
Suggest Repository
BASE Interfaces
Currently in BASE: 72,227,055 Documents of 3,466 Content Sources
http://www.basesearch.net