References

ON COMPLETENESS AND INFERENCE ALGORITHMS OF THE LOGIC WITH IA


[1] J. Lukasiewicz, Aristotle’s Syllogistic from the Standpoint of Modern Formal Logic, Clarendon Press, Oxford, 1951.

[2] J. Corcoran, Completeness of an ancient logic, Journal of Symbolic Logic 37 (1972), 696-702.

[3] L. S. Moss, Completeness theorems for syllogistic fragments, eds. Logics for linguistic structures, Vol. 201, Walter de Gruyter (2008), 143-175.

[4] I. Pratt-Hartmann, Fragments of language, Journal of Logic Language and Information 13(2) (2004), 207-223.

[5] E. L. Keenan and L. M. Faltz, Boolean Semantics for Natural Language, Syntheses Language Library, Vol. 23, D. Reidel Publishing Co., Dordrecht, 1985.

[6] A. Baltag and S. Smets, Three Etudes on Logical Dynamics and the Program of Natural Logic, Johan van Benthem on Logic and Information Dynamics (2014), 705-728.

[7] L. S. Moss, Intersecting adjectives in syllogistic logic, The Mathematics of Language, Springer Berlin Heidelberg (2010), 223-237.

[8] Phokion G. Kolaitis, On the expressive power of logics on finite models, Finite Model Theory and its Applications, Springer Berlin Heidelberg (2007), 27-123.

[9] S. S. Skiena, Transitive closure and reduction, The algorithm design manual (2nd ed.), Springer (2011), 495-497.