default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHugues Leblanc
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
1990 – 1999
- 1999
[j36]Peter Roeper, Hugues Leblanc:
Absolute Probability Functions for Intuitionistic Propositional Logic. J. Philos. Log. 28(3): 223-234 (1999)- 1995
- [j35]Peter Roeper, Hugues Leblanc:
Consequence and Confirmation. Notre Dame J. Formal Log. 36(3): 341-363 (1995) - 1991
- [j34]Peter Roeper, Hugues Leblanc:
Indiscernability and Identiy in Probability Theory. Notre Dame J. Formal Log. 32(1): 1-46 (1991) - [j33]Hugues Leblanc, Peter Roeper, Michael Thau, George Weaver:
Henkin's Completeness Proof: Forty Years Later. Notre Dame J. Formal Log. 32(2): 212-232 (1991) - 1990
- [j32]George Weaver, Michael Thau, Hugues Leblanc:
Extending ω-consistent sets to maximally consistent, ω-complete sets. Math. Log. Q. 36(5): 381-383 (1990)
1980 – 1989
- 1989
- [j31]Hugues Leblanc, Peter Roeper:
On Relativizing Kolmogorov's Absolute Probability Functions. Notre Dame J. Formal Log. 30(4): 485-512 (1989) - 1983
- [j30]Hugues Leblanc:
Probability functions and their assumption sets - the singulary case. J. Philos. Log. 12(4): 379-402 (1983) - [j29]Simon Kochen, Hugues Leblanc, Charles D. Parsons:
Annual Meeting of the Association for Symbolic Logic: Philadelphia 1981. J. Symb. Log. 48(3): 898-910 (1983) - [j28]Hugues Leblanc, Charles G. Morgan:
Probabilistic semantics for intuitionistic logic. Notre Dame J. Formal Log. 24(2): 161-180 (1983) - [j27]Hugues Leblanc, Charles G. Morgan:
Probability theory, intuitionism, semantics, and the Dutch book argument. Notre Dame J. Formal Log. 24(3): 289-304 (1983)
1970 – 1979
- 1979
- [j26]Hugues Leblanc, Bas C. van Fraassen:
On Carnap and Popper Probability Functions. J. Symb. Log. 44(3): 369-373 (1979) - [j25]Hugues Leblanc:
Probabilistic Semantics for First-Order Logic. Math. Log. Q. 25(32): 497-509 (1979) - [j24]Hugues Leblanc:
Generalization in first-order logic. Notre Dame J. Formal Log. 20(4): 835-857 (1979) - 1977
- [j23]Hugues Leblanc:
A strong completeness theorem for 3-valued logic. II. Notre Dame J. Formal Log. 18(1): 107-116 (1977) - 1976
- [j22]Robert P. McArthur, Hugues Leblanc:
A Completeness Result for Quantificational Tense Logic. Math. Log. Q. 22(1): 89-96 (1976) - 1975
- [j21]Hugues Leblanc:
That Principia mathematica, first edition, has a predicative interpretation after all. J. Philos. Log. 4(1): 67-70 (1975) - 1974
- [j20]J. Michael Dunn, Hugues Leblanc, Robert K. Meyer:
Completeness of relevant quantification theories. Notre Dame J. Formal Log. 15(1): 97-121 (1974) - [j19]Harold Goldberg, Hugues Leblanc, George Weaver:
A strong completeness theorem for 3-valued logic. Notre Dame J. Formal Log. 15(2): 325-330 (1974) - [j18]Hugues Leblanc, D. Paul Snyder:
Erratum: "Duals of Smullyan trees". Notre Dame J. Formal Log. 15(4): 648 (1974) - 1972
- [j17]Hugues Leblanc:
Matters of relevance. J. Philos. Log. 1(3-4): 269-286 (1972) - [j16]Hugues Leblanc, Robert K. Meyer:
Matters of separation. Notre Dame J. Formal Log. 13(2): 229-236 (1972) - [j15]Hugues Leblanc, D. Paul Snyder:
Duals of Smullyan trees. Notre Dame J. Formal Log. 13(3): 387-393 (1972) - 1971
- [j14]Hugues Leblanc:
Truth-value semantics for a logic of existence. Notre Dame J. Formal Log. 12(2): 153-168 (1971)
1960 – 1969
- 1968
- [j13]Hugues LeBlanc:
Subformula Theorems for N-Sequents. J. Symb. Log. 33(2): 161-179 (1968) - [j12]Hugues LeBlanc:
A Simplified Account of Validity and Implication for Quantificational Logic. J. Symb. Log. 33(2): 231-235 (1968) - [j11]Hugues LeBlanc:
On Meyer and Lambert's Quantificational Calculus FQ. J. Symb. Log. 33(2): 275-280 (1968) - [j10]Hugues Leblanc:
Syntactically free, semantically bound. A note on variables. Notre Dame J. Formal Log. 9(2): 167-170 (1968) - 1967
- [j9]Richmond H. Thomason, Hugues Leblanc:
All or None: A Novel Choice of Primitives for Elementary Logic. J. Symb. Log. 32(3): 345-351 (1967) - 1966
- [j8]Hugues Leblanc:
Two separation theorems for natural deduction. Notre Dame J. Formal Log. 7(2): 159-180 (1966) - 1963
- [j7]Hugues Leblanc:
Proof routines for the propositional calculus. Notre Dame J. Formal Log. 4(2): 81-104 (1963) - [j6]Nuel D. Belnap Jr., Hugues Leblanc, Richmond H. Thomason:
On not strengthening intuitionistic logic. Notre Dame J. Formal Log. 4(4): 313-320 (1963) - 1962
- [j5]Nuel D. Belnap Jr., Hugues Leblanc:
Intuitionism reconsidered. Notre Dame J. Formal Log. 3(2): 79-82 (1962) - [j4]Hugues Leblanc:
Structural rules of inference. Notre Dame J. Formal Log. 3(3): 201-205 (1962) - 1960
- [j3]Hugues Leblanc:
On Requirements for Conditional Probability Functions. J. Symb. Log. 25(3): 238-242 (1960) - [j2]Hugues Leblanc:
On a recent allotment of probabilities to open and closed sentences. Notre Dame J. Formal Log. 1(4): 171-175 (1960)
1950 – 1959
- 1957
- [j1]Hugues Leblanc:
On Logically False Evidence Statements. J. Symb. Log. 22(4): 345-349 (1957)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:56 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
