Entry Luchkardt:1991:NFU from tcs1990.bib
Last update: Wed Sep 26 02:11:46 MDT 2018
Top |
Symbols |
Numbers |
Math |
A |
B |
C |
D |
E |
F |
G |
H |
I |
J |
K |
L |
M |
N |
O |
P |
Q |
R |
S |
T |
U |
V |
W |
X |
Y |
Z
BibTeX entry
@Article{Luchkardt:1991:NFU,
author = "H. Luchkardt",
title = "New formally undecidable propositions: non-trivial
lower bounds on proof complexity and related theorems",
journal = j-THEOR-COMP-SCI,
volume = "83",
number = "2",
pages = "169--188",
day = "28",
month = jun,
year = "1991",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Fachbereich Math. der J. W. Goethe-Univ., Frankfurt am
main, Germany",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "axioms; computational complexity; formally undecidable
propositions; incompleteness theorem; nontrivial lower
bounds; proof complexity; theorem proving",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}
Related entries
- axiom,
85(2)231,
90(1)199,
94(2)281,
96(1)73,
97(1)157,
103(2)395,
105(1)141,
113(2)293,
114(1)63,
116(2)291,
118(2)167,
121(1)351
- bound,
72(2)251,
73(3)313,
74(2)121,
74(3)313,
74(3)329,
81(2)237,
82(1)19,
82(1)113,
82(1)157,
85(1)155,
85(2)305,
86(2)267,
88(1)59,
91(2)265,
92(1)191,
93(2)279,
96(2)411,
97(2)233,
97(2)285,
98(2)289,
100(1)185,
100(1)223,
102(2)215,
102(2)253,
102(2)355,
106(2)221,
106(2)351,
107(1)77,
107(1)121,
108(2)251,
108(2)271,
108(2)311,
110(1)1,
112(2)355,
112(2)419,
113(1)75,
116(1)195,
116(2)305,
116(2)415,
119(2)267,
120(2)169,
121(1)279,
123(1)95,
123(1)145,
123(2)377,
123(2)389,
125(2)329,
125(2)373,
127(2)395,
128(1)63,
129(1)193,
129(2)263,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)85,
130(1)163,
130(1)175,
131(2)243,
131(2)331,
132(1)259,
132(1)377,
132(1)387,
133(1)23,
133(1)105,
134(1)189,
134(1)253,
136(2)527
- incompleteness,
73(1)47,
130(2)237,
130(2)239
- lower,
74(3)313,
81(2)237,
82(1)113,
82(1)157,
92(1)191,
93(2)279,
96(2)411,
97(2)285,
102(2)215,
106(2)351,
108(2)271,
111(1)59,
112(2)355,
112(2)419,
113(1)75,
116(2)415,
119(2)267,
123(2)389,
125(2)373,
127(2)395,
128(1)63,
129(2)279,
130(1)17,
130(1)49,
130(1)73,
130(1)163,
130(1)175,
130(1)203,
131(2)243,
131(2)331,
133(1)23,
134(1)253
- new,
71(1)29,
71(1)79,
71(2)209,
71(2)265,
80(2)289,
80(2)303,
81(2)201,
81(2)237,
85(2)305,
87(1)43,
91(2)205,
93(1)91,
103(2)283,
104(1)109,
117(1)289,
118(1)81,
119(1)23,
121(1)71
- nontrivial,
74(3)253,
92(2)291,
107(2)357,
121(1)351,
127(2)229
- propositions,
135(1)5
- proving,
71(1)29,
72(2)265,
74(3)253,
75(3)263,
80(2)125,
81(2)223,
83(1)97,
85(2)231,
85(2)305,
85(2)333,
85(2)353,
87(1)221,
88(1)15,
90(1)61,
91(2)265,
93(1)159,
93(2)321,
94(2)335,
95(2)187,
96(1)157,
101(2)161,
101(2)337,
103(1)25,
103(2)283,
103(2)395,
104(1)29,
104(1)109,
105(1)129,
105(1)141,
106(1)21,
106(1)87,
107(2)209,
110(2)249,
113(1)55,
115(1)63,
118(2)193,
119(1)127,
119(1)z,
120(1)1,
120(1)69,
120(1)123,
120(1)157,
124(2)195,
124(2)297,
126(2)143,
127(2)199,
128(1)127,
130(2)239,
133(2)205,
133(2)307,
134(2)403,
134(2)545,
135(1)5,
135(1)111,
135(2)319,
135(2)345
- related,
78(2)357,
106(2)351,
112(1)53,
116(2)373,
125(1)61
- undecidable,
71(2)265,
71(3)281,
87(1)25,
106(2)337,
121(1)71,
127(2)229,
132(1)85,
132(1)129,
134(1)79,
134(2)311,
134(2)365