@article{compref635,
   author = {Zimand,M},
   year = {1996},
   title = {A High-Low Kolmogorov Complexity Law equivalent to the 0-1 Law},
   journal = {Information Processing Letters},
   volume = {57},
   pages = {59-64}
}

@article{compref638,
   author = {Ulrich,D},
   year = {1996},
   title = {The Shortest Possible Length of the Longest Implicational Axiom},
   journal = {Journal of Philosophical Logic},
   volume = {25},
   pages = {101-108}
}

@article{compref209,
   author = {Li,M and Vitanyi,PMB},
   year = {1992},
   title = {Philosophical Issues in Kolmogorov Complexity},
   journal = {Lecture Notes in Computer Science},
   volume = {623},
   pages = {1-15}
}

@article{compref332,
   author = {Van Lambagen},
   year = {1989},
   title = {Algorithmic Information Theory},
   journal = {Journal for Symbolic Logic},
   volume = {54},
   pages = {1389-1400}
}

@article{compref163,
   author = {Hirsch,E},
   year = {1989},
   title = {Negativity and Complexity - Some Logical Considerations},
   journal = {Synthese},
   volume = {81},
   pages = {217-241}
}

@article{compref206,
   author = {Levesque,HJ},
   year = {1988},
   title = {Logic and the Complexity of Reasoning},
   journal = {Journal of Philosophical Logic},
   volume = {17},
   pages = {355-389}
}

@article{compref173,
   author = {Itai,A and Makowsky,JA},
   year = {1987},
   title = {Unification as a Complexity Measure for Logic Programming},
   journal = {Journal of Logic Programming},
   volume = {4},
   pages = {105-117}
}

@book{compref132,
   author = {Girard,JY},
   year = {1987},
   title = {Proof Theory and Logical Complexity},
   publisher = {Bibliopolis},
   address = {Naples}
}

@article{compref133,
   author = {Girard,JY},
   year = {1987},
   title = {Linear Logic},
   journal = {Theoretical Computer Science},
   volume = {50},
   pages = {1-102}
}

@article{compref100,
   author = {Cuhrov,IP},
   year = {1987},
   title = {On the Number of DNF Minimal Relatively Arbitrary Measures of Complexity},
   journal = {Lecture Notes in Computer Science},
   volume = {278},
   pages = {92-94}
}

@article{compref234,
   author = {McMullen,C and Shearer,J},
   year = {1986},
   title = {Prime Implicants, Minimum Cover and the Complexity of Logic Simplification},
   journal = {IEEE Transactions on Computers},
   volume = {35},
   pages = {761-762}
}

@article{compref300,
   author = {Shapiro,S},
   year = {1981},
   title = {Understanding Church's Thesis},
   journal = {Journal of Philosophical Logic},
   volume = {10},
   pages = {353-365}
}

@article{compref154,
   author = {Hawrnack,J and Zygmunt,J},
   year = {1981},
   title = {On the Degree of Complexity of Sentential Logics},
   journal = {Studia Logica},
   volume = {4},
   pages = {142-153}
}

@book{compref167,
   author = {Hopcroft,JE and Ullman,JD},
   year = {1979},
   title = {Introduction to Automata Theory, Languages, and Computation},
   publisher = {Addison-Wesley},
   address = {Reading, Massachusetts}
}

@incollection{compref1,
   author = {Aaderaa,SO and B”rger,E},
   year = {1979},
   title = {The Horn Complexity of Boolean functions and Cook's problem},
   booktitle = {Proceedings of the 5th Scandanavian Logic Symposium},
   editor = {Mayoh,B and Jensen,F},
   publisher = {Aalborg University Press},
   address = {Aalborg},
   pages = {231-256}
}

@book{compref309,
   author = {Sober,E},
   year = {1975},
   title = {Simplicity},
   publisher = {Clarendon Press},
   address = {Oxford}
}

@article{compref241,
   author = {Morin,E},
   year = {1974},
   title = {Complexity},
   journal = {International Journal of Social Science},
   volume = {26},
   pages = {583-597}
}

@article{compref280,
   author = {Robinson,TT},
   year = {1968},
   title = {Independance of Two Nice Sets of Axioms for the Propositional Calculus},
   journal = {Journal for Symbolic Logic},
   volume = {33},
   pages = {265-270}
}

@article{compref135,
   author = {G”del,K},
   year = {1936},
   title = {On the length of proofs},
   journal = {Ergebnisse eines mathematischen Kolloquiums},
   volume = {7},
   pages = {23-24}
}