TL;DR: The Philosophy of Logical Atomism (1918) as discussed by the authors ) is a philosophy of logic at the level of logical atomism, with a focus on atomic and molecular positions.
Abstract: Introduction The Philosophy of Logical Atomism (1918) 1. Facts and Propositions 2. Particulars, Predicates, and Relations 3. Atomic and Molecular Propositions 4. Propositions and Facts with More than One Verb: Beliefs, Etc 5. General Propositions and Existence 6. Descriptions and Incomplete Symbols 7. The Theory of Types and Symbolism: Classes 123 8. Excursions into Metaphysics: What There Is Logical Atomism (1924) Bibliography Chronological Tables Index
TL;DR: The aim of this paper is to provide a compact answer to the questions: why treat complex biological systems in logical terms and how can one do it conveniently, and a compact matricial presentation on the use of logical variables with more than two values.
TL;DR: The data reveal a surprisingly simple empirical ‘law’: the subjective difficulty of a concept is directly proportional to its Boolean complexity (the length of the shortest logically equivalent propositional formula)—that is, to its logical incompressibility.
Abstract: One of the unsolved problems in the field of human concept learning concerns the factors that determine the subjective difficulty of concepts: why are some concepts psychologically simple and easy to learn, while others seem difficult, complex or incoherent? This question was much studied in the 1960s1 but was never answered, and more recent characterizations of concepts as prototypes rather than logical rules2,3 leave it unsolved4,5,6. Here I investigate this question in the domain of Boolean concepts (categories defined by logical rules). A series of experiments measured the subjective difficulty of a wide range of logical varieties of concepts (41 mathematically distinct types in six families—a far wider range than has been tested previously). The data reveal a surprisingly simple empirical ‘law’: the subjective difficulty of a concept is directly proportional to its Boolean complexity (the length of the shortest logically equivalent propositional formula)—that is, to its logical incompressibility.