不教，但在定理证明工具如HOL中是很重要的。 有相关的一个年刊IEEE Symposium on Logic in Computer Science（LICS）。 Mathematical Logic for Computer Scienceby Mordechai Ben-Ari. Springer-Verlag

and Martin Rinard. "Structural Subtyping of Non-Recursive Types is Decidable". In Eighteenth Annual IEEE Symposium on Logic in Computer Science, 2003.

The Theory of Hybrid Automata, 11th Annual Symposium on Logic in Computer Science (LICS), IEEE Computer Society Press: 278–292, 1996, （原始内容存档于2010-01-27） 

hypergraph orientation, Proceedings of Eighth Annual IEEE Symposium on Logic in Computer Science (LICS '93): 179–190, 1993, S2CID 39254668, doi:10.1109/LICS

(帮助) Amir Pnueli, The temporal logic of programs. Proceedings of the 18th Annual Symposium on Foundations of Computer Science (FOCS), 1977, 46–57. doi:10