SubIndex on LOGIC (BibTex)

• Zimand,M; 1996, A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law, Information Processing Letters, 57, 59-64
• Ulrich,D; 1996, The Shortest Possible Length of the Longest Implicational Axiom, Journal of Philosophical Logic, 25, 101-108
• Li,M; Vitanyi,PMB; 1992, Philosophical Issues in Kolmogorov Complexity, Lecture Notes in Computer Science, 623, 1-15
• Van Lambagen; 1989, Algorithmic Information Theory, Journal for Symbolic Logic, 54, 1389-1400
• Hirsch,E; 1989, Negativity and Complexity - Some Logical Considerations, Synthese, 81, 217-241
• Levesque,HJ; 1988, Logic and the Complexity of Reasoning, Journal of Philosophical Logic, 17, 355-389
• Itai,A; Makowsky,JA; 1987, Unification as a Complexity Measure for Logic Programming, Journal of Logic Programming, 4, 105-117
• Girard,JY; 1987, Proof Theory and Logical Complexity, Bibliopolis, Naples
• Girard,JY; 1987, Linear Logic, Theoretical Computer Science, 50, 1-102
• Cuhrov,IP; 1987, On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity, Lecture Notes in Computer Science, 278, 92-94
• McMullen,C; Shearer,J; 1986, Prime Implicants, Minimum Cover and the Complexity of Logic Simplification, IEEE Transactions on Computers, 35, 761-762
• Shapiro,S; 1981, Understanding Church's Thesis, Journal of Philosophical Logic, 10, 353-365
• Hawrnack,J; Zygmunt,J; 1981, On the Degree of Complexity of Sentential Logics, Studia Logica, 4, 142-153
• Hopcroft,JE; Ullman,JD; 1979, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, Reading, Massachusetts
• Aaderaa,SO; B”rger,E; 1979, The Horn Complexity of Boolean functions and Cook's problem, in Proceedings of the 5th Scandanavian Logic Symposium, Eds.Mayoh,B; Jensen,F; , Aalborg University Press, Aalborg, pages 231-256
• Sober,E; 1975, Simplicity, Clarendon Press, Oxford
• Morin,E; 1974, Complexity, International Journal of Social Science, 26, 583-597
• Robinson,TT; 1968, Independance of Two Nice Sets of Axioms for the Propositional Calculus, Journal for Symbolic Logic, 33, 265-270
• G”del,K; 1936, On the length of proofs, Ergebnisse eines mathematischen Kolloquiums, 7, 23-24