Entry Danko:1986:FOA from tcs1985.bib
Last update: Thu Sep 27 02:46:57 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{Danko:1986:FOA,
author = "W. Danko",
title = "First-order approximation of algorithmic theories",
journal = j-THEOR-COMP-SCI,
volume = "48",
number = "2--3",
pages = "257--272",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4240 (Programming and
algorithm theory)",
corpsource = "Inst. of Math., Warsaw Univ., Poland",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "algorithmic theories; completeness; decidability;
first-order approximation; first-order language; formal
languages; language translation; many-sorted
algorithmic logic; many-valued logics; natural numbers;
nonstandard computations; object coding computations;
programming theory",
pubcountry = "Netherlands A07",
treatment = "T Theoretical or Mathematical",
}
Related entries
- algorithmic,
40(2)195,
40(2)211,
46(2)285
- approximation,
36(2)309,
38(2)157,
38(2)293,
39(1)69,
39(2)207,
39(2)225,
40(2)195,
40(2)319,
41(2)125,
41(2)319,
42(1)1,
44(1)1,
46(2)329,
48(2)145,
51(1)129,
51(1)177,
53(2)335,
54(1)129,
54(2)341,
57(1)131,
57(2)239,
58(1)183,
64(1)15,
66(1)1,
68(1)1
- coding,
65(0)123,
65(2)171,
65(2)z
- completeness,
35(2)345,
37(1)1,
39(2)135,
39(2)189,
44(2)127,
46(2)197,
47(1)1,
47(3)263,
54(2)249,
56(1)135,
56(3)289,
57(2)161,
58(1)155,
61(1)17,
63(1)43,
65(1)1,
65(1)35,
65(1)85,
65(3)343,
67(2)203,
68(3)277,
69(1)55,
69(3)289
- computation,
35(2)191,
36(1)1,
36(1)127,
39(2)107,
40(2)211,
40(2)275,
40(2)323,
41(2)325,
43(2)149,
44(1)1,
46(2)159,
46(2)319,
47(1)39,
47(2)111,
47(2)131,
47(2)205,
47(3)315,
49(2)171,
52(3)193,
52(3)251,
53(1)125,
53(2)201,
53(2)267,
54(1)65,
57(2)327,
58(1)347,
59(1)25,
59(1)133,
59(3)277,
59(3)297,
60(3)231,
60(3)297,
62(1)187,
62(3)311,
64(1)55,
64(3)221,
67(1)99,
68(1)19,
68(3)267,
68(3)277
- decidability,
35(1)1,
35(2)191,
35(2)227,
35(2)329,
35(2)337,
36(2)173,
37(2)123,
38(1)117,
39(2)281,
41(1)51,
41(1)105,
41(2)247,
44(2)199,
44(2)237,
46(1)83,
47(1)27,
47(1)39,
47(1)71,
47(2)225,
47(3)247,
48(2)329,
49(1)43,
51(3)255,
52(3)177,
53(2)243,
55(1)1,
55(2)141,
58(1)231,
59(3)287,
61(2)259,
61(2)289,
64(3)305,
64(3)343,
65(2)265,
66(1)55,
67(1)5,
67(1)19,
67(1)129,
67(2)143,
67(2)303,
68(3)267,
68(3)319,
68(3)343
- first-order,
41(2)247,
41(2)271,
47(3)329,
50(3)285,
54(2)199,
56(3)289,
57(2)317,
58(1)347,
61(1)83,
66(2)205
- many-sorted,
50(2)103
- many-valued,
47(3)247,
52(1)145,
68(2)135
- natural,
37(1)1,
46(2)175,
52(3)307,
56(2)187,
56(3)289,
63(1)43,
63(1)91,
64(1)83
- nonstandard,
46(2)239,
50(3)285,
65(1)35,
66(3)299,
68(3)277
- number,
43(2)265,
44(1)1,
46(2)175,
47(2)205,
47(3)299,
52(1)77,
54(2)299,
54(2)341,
55(2)265,
56(3)289,
58(1)209,
60(3)231,
64(1)119,
65(2)123,
65(2)131,
65(2)153,
65(2)189,
65(2)197,
65(2)213,
65(2)221,
65(2)249,
68(2)155,
68(2)203
- object,
48(2)297,
57(1)113,
59(1)85,
61(2)225,
62(0)3,
62(1)3,
63(1)63
- order, first-,
41(2)247,
41(2)271,
47(3)329,
50(3)285,
54(2)199,
56(3)289,
57(2)317,
58(1)347,
61(1)83,
66(2)205
- sorted, many-,
50(2)103
- translation,
39(2)89,
42(3)251,
61(1)83,
63(3)253,
66(1)27
- valued, many-,
47(3)247,
52(1)145,
68(2)135