English Transitive reduction Cited by user David Eppstein on 24 Oct 2023 In the mathematical field of graph theory, a transitive reduction of a directed graph D is another directed graph with the same vertices and as few edges as possible…
English Logic for Computable Functions Cited by user Matěj Grabovský on 16 Feb 2016 Logic for Computable Functions (LCF) is an interactive automated theorem prover developed at the universities of Edinburgh and Stanford by Robin Milner and others in 1972.