Bibliographic record
Abstract
An Invitation to Formal Reasoning introduces the discipline of formal logic by means of a powerful new system formulated by Fred Sommers. This system, term logic, is different in a number of ways from the standard system employed in modern logic; most striking is its greater simplicity and naturalness. Based on a radically different theory of logical syntax than the one Frege used when initiating modern mathematical logic in the 19th Century, term logic borrows insights from Aristotle's syllogistic, Scholastic logicians, Leibniz, and the 19th century British algebraists. Term logic takes its syntax directly from natural language, construing statements as combinations of pairs of terms, where complex terms are taken to have the same syntax as statements. Whereas standard logic requires extensive 'translation' from natural language to symbolic language, term logic requires only 'transcription' into the symbolic language. Its naturalness is the result of its ability to stay close to the forms of sentences usually found in every day discourse. Written by the founders of the term logic approach, An Invitation to Formal Reasoning is a unique introduction and exploration of this new system, offering numerous exercises and examples throughout the text. Summarising the standard system of mathematical logic to set term logic in context, and showing how the two systems compare, this book presents an alternative approach to standard modern logic for those studying formal logic, philosophy of language or computer theory. Fred Sommers is Professor Emeritus, Brandeis University, USA; George Englebretsen is Professor of Philosophy, Bishop's University, Canada.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".