Hugues Leblanc
Dados Biográficos
| ID | 443887 |
|---|---|
| NOME | Hugues Leblanc |
| PRENOMES | Hugues |
| SOBRENOME | Leblanc |
| ASSINATURA | LEBLANC H |
| AFILIAÇÕES | Bryn Mawr College |
| VERIFICADO | Não |
| TOTAL DE OBRAS | 37 |
| TOTAL DE CITAÇÕES | 28 |
| TOTAL COMO AUTOR | 37 |
| TOTAL COMO EDITOR | 0 |
| PRIMEIRO ANO DE PUBLICAÇÃO | 1950 |
| ANO MAIS RECENTE DE PUBLICAÇÃO | 1997 |
| ÍNDICE H | 3 |
Commentary on W. V. Quine's “Free Logic, Description, and Virtual Classes”
Since I wrote my doctoral dissertation lo! these forty-seven years ago under Professor Quine, my colleague Alain Voizard thought it fitting that I comment on the paper just delivered. The invitation flattered me, I confess, as did Professor Quine's choice of a subject: free logic, a logic of which I was one of the numerous fathers thirty-five years ago. So, it is in my capacity as a commentator that I address you now, saving for tomorrow afternoo…
De A et B , de leur indépendance logique, et de ce qu'ils n'ont aucun contenu factuel commun
The logical independence of two statements is tantamount to their probabilistic independence, the latter understood in a sense that derives from stochastic independence. And analogous logical and probabilistic senses of having the same factual content similarly coincide. These results are extended to notions of non-symmetrical independence and independence among more than two statements
Of A and B being logically independent of each other and of their having no common factual content
Probability Functions
This paper studies the extent to which probability functions are recursively definable. It proves, in particular, that the ( absolute ) probability of a statement A is recursively definable from a certain point on, to wit: from the ( absolute ) probabilities of certain atomic components and conjunctions of atomic components of A on, but to no further extent. And it proves that, generally, the probability of a statement A relative to a statement B…
Les fonctions de probabilité
Pensons aux divers énoncés qui peuvent être composés à partir d'un ensemble fini ou dénombrable d'énoncés atomiques à l'aide de, disons, ‘ ̃’ et ‘&’; soit A n'importe lequel de ces énoncés; et soit l'ensemble S A des composantes atomiques de A . La valeur de vérité de A dépend évidemment des valeurs de vérité de certains membres de S A (tous les membres de S A dans plusieurs cas, mais seulemént certains d'entre eux dans d'autres cas). En effet, s…
The Autonomy of Probability Theory (Notes on Kolmogorov, Rényi, and Popper)
Kolmogorov's account in his [1933] of an absolute probability space presupposes given a Boolean algebra, and so does Rényi's account in his [1955] and [1964] of a relative probability space. Anxious to prove probability theory ‘autonomous’. Popper supplied in his [1955] and [1957] accounts of probability spaces of which Boolean algebras are not and [1957] accounts of probability spaces of which fields are not prerequisites but byproducts instead.…
Probability functions and their assumption sets ? The binary case
What Price Substitutivity? A Note on Probability Theory
Teddy Seidenfeld recently claimed that Kolmogorov's probability theory transgresses the Substitutivity Law. Underscoring the seriousness of Seidenfeld's charge, the author shows that (Popper's version of) the law, to wit: If (∀ D )( Pr ( B,D ) = Pr ( C,D )), then Pr ( A,B ) = Pr ( A,C ), follows from just five constraints on Pr of the most elementary and most basic sort
Queries on Truth-Conditions
Studying some familiar truth-conditions, I shall detail the role they play in elementary logic and inquire into our grounds for holding them true. I shall discharge the first of these assignments with a good deal of assurance, but the second with far less; to my mind, (1) below mirrors our use of ‘and’, (6) our use of ‘every’, (8) our use of ‘necessarily’, etc. pretty accurately, but little evidence to that effect has ever been supplied, and — di…
Techniques of Deductive Inference
La Philosophie Analytique
Statistical and Inductive Probabilities
Études sur les règles d'inférence dites règles de Gentzen (II)
Je vais traiter ici des inférences dont la validité tient au rôle qu'y jouent les cinq connecteurs « ⊃ », « ∼ », « & », « V » et « ≡ », les deux quantificateurs « ∀ » et « ∃ », et le signe d'identité « = ». Qu'on me permette de rappeler que les deux conjectures présentéd dans ma première étude se sont avéré'es justes. En premier lieu, toute règle de structure et toute règie d'élimination ou d'introduction pour « & » ou « V » qui vaut pour la logi…
Études sur les règles d'inférence dites règles de Gentzen
Cet article a pour objet d'étudier diverses règies d'inférence dites “règies de Gentzen”. Je me limiterai dans cette première partie aux inférences dont la validité tient au rôle qu'y jouent les cinq connecteurs « ⊃ », « ∼ » , « & », « ∨ », et « ≡ ». Celles dont la validité tient au rôle qu'y jouent ces cinq connecteurs, les deux quantificateurs « ∀ » et « ∃ », et le signe d'égalité ou d'identité « = », feront l'objet d'une autre étude. Quelques-…
Probabilities as Truth-Value Estimates
The author recently claimed that Pr(P, Q), where Pr is a probability function and P and Q are two sentences of a formalized language L , qualifies as an estimate—made in the light of Q —of the truth-value of P in L. To substantiate his claim, the author establishes here that the two strategies lying at the opposite extremes of the spectrum of truth-value estimating strategies meet the first five of the six requirements (R1-R6) currently placed up…
A New Interpretation of c (h, e)
Truth and Denotation. A Study in Semantical Theory
On So-Called Degrees of Confirmation
Professor Darlington and the Confirmation of Laws
The author discusses Professor Darlington's recent paper “On the Confirmation of Laws.” He criticizes Professor Darlington for not writing out in full the evidence sentence in formula III of his paper, and expresses doubts as to whether Professor Darlington's solution to the problem of the confirmation of laws follows from the complete version of that formula
Nondesignating Singular Terms
An Introduction to Deductive Logic
Le formalisme logico-mathematique et le probleme du non-sens
On chances and estimated chances of being true
Logic and Knowledge, Essays 1901-1950
An Introduction to Deductive Logic
Logic Without Metaphysics
Nondesignating Singular Terms
La Philosophie Analytique
What Price Substitutivity? A Note on Probability Theory
Teddy Seidenfeld recently claimed that Kolmogorov's probability theory transgresses the Substitutivity Law. Underscoring the seriousness of Seidenfeld's charge, the author shows that (Popper's version of) the law, to wit: If (∀ D )( Pr ( B,D ) = Pr ( C,D )), then Pr ( A,B ) = Pr ( A,C ), follows from just five constraints on Pr of the most elementary and most basic sort
The Autonomy of Probability Theory (Notes on Kolmogorov, Rényi, and Popper)
Kolmogorov's account in his [1933] of an absolute probability space presupposes given a Boolean algebra, and so does Rényi's account in his [1955] and [1964] of a relative probability space. Anxious to prove probability theory ‘autonomous’. Popper supplied in his [1955] and [1957] accounts of probability spaces of which Boolean algebras are not and [1957] accounts of probability spaces of which fields are not prerequisites but byproducts instead.…
Probability functions and their assumption sets ? The binary case
On chances and estimated chances of being true
Introduction to Mathematical Logic. Volume I
On Definitions
Present-day logic regards definitions as syntactical devices of abbreviation. This view, summed up in the terse adage: “To define is to eliminate,” obscures the vital part played by definitions in deductive sciences. Abstract calculi, to become noetic tools, must be interpreted; so the richer the interpretation, the more efficient the tool. But most calculi are based on a restricted number of primitives; they thus embrace, at the outset, a restri…
Le déclin des absolus mathématico-logiques . Georges Bouligand, Jean Desgranges
Positions and Propositions on Universals
The Structure of Appearance
Introduction to Logical Theory
1. Logical Appraisal 2. Formal Logic 3. Truth-Functions 4. Classes: An Alternative Interpretation of the Tabular System 5. Predicative Formulae and Quantifiers 6. Subjects, Predicates, and Existence 7. General Statements and Relations 8. Two Kinds of Logic 9. Inductive Reasoning and Probability
Évidence logique et degré de confirmation
Problems of Analysis
An Introduction to Deductive Logic
Philosophy and Analysis
An Introduction to Deductive Logic
Logic Without Metaphysics
Introduction to Mathematical Logic. Volume I
Introduccion a la Logica Simbolica
Logic and Knowledge, Essays 1901-1950
Professor Darlington and the Confirmation of Laws
The author discusses Professor Darlington's recent paper “On the Confirmation of Laws.” He criticizes Professor Darlington for not writing out in full the evidence sentence in formula III of his paper, and expresses doubts as to whether Professor Darlington's solution to the problem of the confirmation of laws follows from the complete version of that formula
Nondesignating Singular Terms
An Introduction to Deductive Logic
Le formalisme logico-mathematique et le probleme du non-sens
On chances and estimated chances of being true
Truth and Denotation. A Study in Semantical Theory
On So-Called Degrees of Confirmation
Probabilities as Truth-Value Estimates
The author recently claimed that Pr(P, Q), where Pr is a probability function and P and Q are two sentences of a formalized language L , qualifies as an estimate—made in the light of Q —of the truth-value of P in L. To substantiate his claim, the author establishes here that the two strategies lying at the opposite extremes of the spectrum of truth-value estimating strategies meet the first five of the six requirements (R1-R6) currently placed up…
A New Interpretation of c (h, e)
Études sur les règles d'inférence dites règles de Gentzen
Cet article a pour objet d'étudier diverses règies d'inférence dites “règies de Gentzen”. Je me limiterai dans cette première partie aux inférences dont la validité tient au rôle qu'y jouent les cinq connecteurs « ⊃ », « ∼ » , « & », « ∨ », et « ≡ ». Celles dont la validité tient au rôle qu'y jouent ces cinq connecteurs, les deux quantificateurs « ∀ » et « ∃ », et le signe d'égalité ou d'identité « = », feront l'objet d'une autre étude. Quelques-…
Études sur les règles d'inférence dites règles de Gentzen (II)
Je vais traiter ici des inférences dont la validité tient au rôle qu'y jouent les cinq connecteurs « ⊃ », « ∼ », « & », « V » et « ≡ », les deux quantificateurs « ∀ » et « ∃ », et le signe d'identité « = ». Qu'on me permette de rappeler que les deux conjectures présentéd dans ma première étude se sont avéré'es justes. En premier lieu, toute règle de structure et toute règie d'élimination ou d'introduction pour « & » ou « V » qui vaut pour la logi…
Philosophy (32 obras) · Epistemology (25 obras) · Computer Science (14 obras) · Philosophy (14 obras) · Logic, Reasoning, and Knowledge (13 obras) · Advanced Algebra and Logic (9 obras) · Mathematics (8 obras) · Humanities (7 obras) · Linguistics (5 obras) · Mathematical economics (5 obras)