id	author	title	date	pages	extension	mime	words	sentence	flesch	summary	cache	txt
bc386h4758v	Jongsuh Lee	Computation in Aristotle's Syllogistic	2021		.txt	text/plain	327	14	39	For multi-premise syllogisms with unordered premises, I suggest that the problem of finding all the relevant trees may be NP-complete. For such syllogisms whose premises are ordered, I show both that the problem is computationally solvable, and executable in polynomial time.	cache/bc386h4758v.txt	txt/bc386h4758v.txt