Entry Harland:1997:GPC from complngs.bib
Last update: Thu Jun 20 02:00:37 MDT 2019
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{Harland:1997:GPC,
author = "James Harland",
title = "On goal-directed provability in classical logic",
journal = j-COMP-LANGS,
volume = "23",
number = "2-4",
pages = "161--178",
month = jul # "--" # dec,
year = "1997",
CODEN = "COLADA",
ISSN = "0096-0551 (print), 1873-6742 (electronic)",
ISSN-L = "0096-0551",
bibdate = "Sun Oct 25 08:22:03 MST 1998",
bibsource = "Compendex database;
http://www.math.utah.edu/pub/tex/bib/complngs.bib",
acknowledgement = ack-nhfb,
affiliation = "Royal Melbourne Inst of Technology",
affiliationaddress = "Melbourne, Aust",
classification = "721.1; 723.1; 723.1.1; C4210 (Formal logic); C4240
(Programming and algorithm theory); C6110L (Logic
programming); C6140D (High level languages)",
conference = "Proceedings of the 1994 11th International Conference
on Logic Programming, ICLP'94",
corpsource = "Dept. of Comput. Sci., R. Melbourne Inst. of Technol.,
Vic., Australia",
journal-URL = "http://www.sciencedirect.com/science/journal/00960551",
journalabr = "Comput Lang",
keywords = "answer substitutions; Classical logic; classical
logic; completeness; computation; disjunctive logic
programs; Formal languages; Formal logic; formal logic;
Goal directed proofs; goal-directed provability;
intuitionistic logic; Logic programming; logic
programming; logic programming languages; logical
connectives; permutability properties; programming
theory; proof search; proof-theoretic characterization;
Theorem proving; uniform proof",
meetingaddress = "Santa Margherite Ligure, Italy",
meetingdate = "Jun 1994",
meetingdate2 = "06/94",
pubcountry = "UK",
treatment = "T Theoretical or Mathematical",
}
Related entries
- answer,
17(2)133,
36(2)158
- C4210,
22(1)1,
22(2)95,
22(2)115,
22(2)143
- C4240,
22(1)27,
22(4)215,
22(4)225,
23(2)61,
23(2)179
- C6110L,
22(2)51,
22(2)79,
22(2)95,
22(2)115,
22(2)143,
22(2)181,
22(4)237,
23(1)25,
23(2)61,
23(2)87,
23(2)121
- C6140D,
22(1)1,
22(1)15,
22(2)79,
22(2)95,
22(2)115,
22(2)165,
22(4)193,
22(4)205,
22(4)215,
22(4)237,
22(4)259,
23(1)1,
23(1)25,
23(2)61,
23(2)87,
23(2)121
- characterization,
8(2)69
- classical,
15(1)27
- completeness,
16(3)259,
17(1)75,
19(2)79,
23(2)61
- computation,
1(2)121,
3(3)163,
4(1)17,
9(3)133,
10(2)147,
11(3)143,
12(1)1,
12(2)109,
15(3)141,
16(2)179,
16(3)197,
19(1)1,
20(1)1,
20(1)25,
20(4)253,
22(2)95,
28(2)181,
33(3)82,
34(4)184,
35(3)217,
40(1)19
- connectives,
44(z)238,
45(z)238
- directed,
1(3)233,
3(2)115,
6(1)19,
7(2)69,
8(1)1,
14(3)205,
15(2)65,
19(3)169,
19(4)213,
21(2)113
- directed, goal-,
13(1)13,
15(1)41,
18(4)217
- disjunctive,
9(3)133
- goal,
1(1)61,
7(2)69,
8(1)1,
18(2)137,
31(2)49
- goal-directed,
13(1)13,
15(1)41,
18(4)217
- logical,
1(2)161,
1(3)197,
2(1)27,
7(3)147,
9(3)133,
9(3)183,
12(1)9,
14(1)35,
17(2)133,
19(2)79,
22(2)51,
22(4)237,
23(1)25
- proof,
1(2)151,
2(4)149,
3(2)65,
5(1)1,
5(2)77,
17(2)101,
17(3)157,
18(4)273,
21(2)67,
47(z)19
- property,
3(1)37,
3(4)265,
16(1)19,
16(3)259,
17(3)157,
20(2)89,
22(1)1,
30(3)231,
43(z)116,
47(z)77
- proving,
3(1)37,
11(3)173,
17(3)157,
36(1)60,
47(z)77
- search,
3(1)31,
5(2)52,
19(3)205,
20(2)89,
21(2)113,
23(2)61,
46(z)182,
47(z)153,
47(z)211
- substitution,
1(4)287,
20(2)89
- theorem,
11(2)55,
11(3)173,
17(3)157
- uniform,
23(2)121,
31(3)143,
36(3)250