default search action
Charles G. Morgan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j30]Charles Morgan:
Mitchell-Inspired forcing, with Small Working parts and Collections of Models of Uniform Size as Side conditions, and Gap-One Simplified Morasses. J. Symb. Log. 87(1): 392-415 (2022)
2010 – 2019
- 2016
- [j29]James Cummings
, Mirna Dzamonja
Small Universal families of graphs on ℵω+ 1. J. Symb. Log. 81(2): 541-569 (2016) - [j28]Tamra Heberling, Lisa Davis, Jakub Gedeon, Charles Morgan, Tomás Gedeon:
A Mechanistic Model for Cooperative Behavior of Co-transcribing RNA Polymerases. PLoS Comput. Biol. 12(8) (2016) - 2013
- [c8]Valeria de Paiva
Natural Number Objects in Dialectica Categories. LSFA 2013: 53-65
2000 – 2009
- 2007
- [j27]Alexander Hertel, Philipp Hertel, Charles Morgan:
A Sound and Complete Proof Theory for Propositional Logical Contingencies. Notre Dame J. Formal Log. 48(4): 521-530 (2007) - 2005
- [c7]John R. Talburt, Charles G. Morgan, Terry Talley, Ken Archer:
The Application of Commercial Data Integration Technologies to Improve the Quality of Anonymous Entity Resolution in the Public Sector. ICIQ 2005 - 2004
- [j26]Mirna Dzamonja
Wild edge colourings of graphs. J. Symb. Log. 69(1): 255-264 (2004) - [c6]Charles G. Morgan:
Many Valued Probability Theory. ISMVL 2004: 294-299 - [c5]Charles G. Morgan:
Probability, rational belief and belief change. NMR 2004: 297-305 - 2003
- [j25]François Lepage, Charles Morgan:
Probabilistic Canonical Models for Partial Logics. Notre Dame J. Formal Log. 44(3): 125-138 (2003) - 2000
- [j24]Charles G. Morgan:
The Nature of Nonmonotonic Reasoning. Minds Mach. 10(3): 321-360 (2000)
1990 – 1999
- 1998
- [j23]Beata Konikowska, Charles G. Morgan, Ewa Orlowska:
A Relational Formalisation of Arbitrary Finite Valued Logics. Log. J. IGPL 6(5): 755-774 (1998) - [j22]Charles G. Morgan:
Higher Gap Morasses, IA: Gap-Two Morasses and Condensation. J. Symb. Log. 63(3): 753-787 (1998) - [c4]Beata Konikowska, Charles G. Morgan, Ewa Orlowska:
Relational semantics for arbitrary finite valued logics. RelMiCS 1998: 138-143 - 1996
- [j21]Charles G. Morgan:
Morasses, Square and Forcing Axioms. Ann. Pure Appl. Log. 80(2): 139-163 (1996) - 1995
- [j20]Charles G. Morgan, Edwin D. Mares
Conditionals, probability, and non-triviality. J. Philos. Log. 24(5): 455-467 (1995) - [j19]Charles G. Morgan:
A Gap Cohomology Group. Math. Log. Q. 41: 564-570 (1995) - 1994
- [j18]Charles G. Morgan:
Evidence, Belief, and Inference. Comput. Intell. 10: 79-84 (1994) - 1993
- [j17]Charles G. Morgan:
Introduction. Stud Logica 52(2): 181 (1993) - 1992
- [c3]Charles G. Morgan:
An Automated Theorem Prover for Relational Logic (Abstract). TABLEAUX 1992: 56-58 - 1991
- [j16]Charles G. Morgan:
Logic, probability theory, and artificial intelligence - Part I: the probabilistic foundations of logic. Comput. Intell. 7: 94-109 (1991)
1980 – 1989
- 1988
- [j15]Charles G. Morgan:
Probability theory versus procedural pessimism. Comput. Intell. 4: 94-97 (1988) - 1986
- [c2]Charles G. Morgan:
AUTOLOGIC at University of Victoria. CADE 1986: 699-700 - 1984
- [j14]Charles G. Morgan:
Weak Conditional Comparative Probability as a Formal Semantic Theory. Math. Log. Q. 30(13-16): 199-212 (1984) - 1983
- [j13]Hugues Leblanc, Charles G. Morgan:
Probabilistic semantics for intuitionistic logic. Notre Dame J. Formal Log. 24(2): 161-180 (1983) - [j12]Hugues Leblanc, Charles G. Morgan:
Probability theory, intuitionism, semantics, and the Dutch book argument. Notre Dame J. Formal Log. 24(3): 289-304 (1983) - 1982
- [j11]Charles G. Morgan:
There is a probabilistic semantics for every extension of classical sentence logic. J. Philos. Log. 11(4): 431-442 (1982) - [j10]Charles G. Morgan:
Simple probabilistic semantics for propositional K, T, B, S4, and S5. J. Philos. Log. 11(4): 443-458 (1982)
1970 – 1979
- 1979
- [j9]Charles G. Morgan:
Local and global operators and many-valued modal logics. Notre Dame J. Formal Log. 20(2): 401-411 (1979) - [j8]Charles G. Morgan:
Note on a strong liberated modal logic and its relevance to possible world skepticism. Notre Dame J. Formal Log. 20(4): 718-722 (1979) - 1976
- [j7]Charles G. Morgan:
Tuomela on deductive explanation. J. Philos. Log. 5(4): 511-525 (1976) - [j6]Charles G. Morgan:
Methods for Automated Theorem Proving in Nonclassical Logics. IEEE Trans. Computers 25(8): 852-862 (1976) - 1975
- [j5]Charles G. Morgan:
Liberated versions ofT, S4, andS5. Arch. Math. Log. 17(3-4): 85-90 (1975) - [j4]Charles G. Morgan:
Weak Liberated Versions of T and S4. J. Symb. Log. 40(1): 25-30 (1975) - [c1]Charles G. Morgan:
Automated Hypothesis Generation Using Extended Inductive Resolution. IJCAI 1975: 351-356 - 1973
- [j3]Charles G. Morgan:
Sentential calculus for logical falsehoods. Notre Dame J. Formal Log. 14(3): 347-353 (1973) - [j2]Charles G. Morgan:
Truth, falsehood, and contingency in first-order predicate calculus. Notre Dame J. Formal Log. 14(4): 536-542 (1973) - 1971
- [j1]Charles G. Morgan:
Hypothesis Generation by Machine. Artif. Intell. 2(2): 179-187 (1971)
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-24 23:09 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: