𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Deductively Definable Logics of Induction

✍ Scribed by John D. Norton

Publisher
Springer Netherlands
Year
2010
Tongue
English
Weight
643 KB
Volume
39
Category
Article
ISSN
0022-3611

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A deduction theorem schema for deductive
A deduction theorem schema for deductive systems of propositional logics
✍ Janusz Czelakowski; WiesΕ‚aw Dziobiak πŸ“‚ Article πŸ“… 1991 πŸ› Springer Netherlands 🌐 English βš– 326 KB

We propose a new schema for the deduction theorem and prove that the deductive system S of a propositional logic L fulfills the proposed schema if and only if there exists a finite set A(p, q) of propositional formulae involving only propositional letters p and q such that A(p, p) C\_ L and p, A(p,

A logic-based theory of deductive argume
A logic-based theory of deductive arguments
✍ Philippe Besnard; Anthony Hunter πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 244 KB

We explore a framework for argumentation (based on classical logic) in which an argument is a pair where the first item in the pair is a minimal consistent set of formulae that proves the second item (which is a formula). We provide some basic definitions for arguments, and various kinds of counter-

Logical Definability of Counting Functio
Logical Definability of Counting Functions
✍ Kevin J. Compton; Erich GrΓ€del πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 797 KB

The relationship between counting functions and logical expressibility is explored. The most well studied class of counting functions is \*P, which consists of the functions counting the accepting computation paths of a nondeterministic polynomial-time Turing machine. For a logic L, \*L is the class