Thomas Macaulay Ferguson

Orcid: 0000-0002-6494-1833

According to our database1, Thomas Macaulay Ferguson authored at least 30 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Executability and Connexivity in an Interpretation of Griss.
Stud Logica, April, 2024

2023
Subject-Matter and Intensional Operators II: Applications to the Theory of Topic-Sensitive Intentional Modals.
J. Philos. Log., December, 2023

Monstrous Content and the Bounds of Discourse.
J. Philos. Log., February, 2023

Structural Completeness and Superintuitionistic Inquisitive Logics.
Proceedings of the Logic, Language, Information, and Computation, 2023

2022
Deep ST.
J. Philos. Log., 2022

Non-Deterministic Many-Valued Modal Logic.
Proceedings of the 52nd IEEE International Symposium on Multiple-Valued Logic, 2022

2021
Meaningless Divisions.
Notre Dame J. Formal Log., 2021

Tableaux and Restricted Quantification for Systems Related to Weak Kleene Logic.
Proceedings of the Automated Reasoning with Analytic Tableaux and Related Methods, 2021

Modeling Intentional States with Subsystems of ALC.
Proceedings of the 34th International Workshop on Description Logics (DL 2021) part of Bratislava Knowledge September (BAKS 2021), 2021

2020
Explicit analyses of proof/refutation interaction for constructible falsity and Heyting-Brouwer logic.
J. Log. Comput., 2020

The Keisler-Shelah theorem for $\mathsf{QmbC}$ through semantical atomization.
Log. J. IGPL, 2020

2019
Logics based on linear orders of contaminating values.
J. Log. Comput., 2019

Corrigendum: The Keisler - Shelah theorem for QmbC through semantical atomization.
Log. J. IGPL, 2019

Modeling the Interaction of Computer Errors by Four-Valued Contaminating Logics.
Proceedings of the Logic, Language, Information, and Computation, 2019

2018
A Gödel-Artemov-Style Analysis of Constructible Falsity.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2018

2017
The Proscriptive Principle and Logics of Analytic Implication.
PhD thesis, 2017

Rivals to Belnap-Dunn Logic on Interlaced Trilattices.
Stud Logica, 2017

Dunn-Priest Quotients of Many-Valued Structures.
Notre Dame J. Formal Log., 2017

2016
Correia Semantics Revisited.
Stud Logica, 2016

Faulty Belnap computers and subsystems of FDE.
J. Log. Comput., 2016

Editorial Preface.
FLAP, 2016

On Arithmetic Formulated Connexively.
FLAP, 2016

2015
Two paradoxes of semantic information.
Synth., 2015

Logics of Nonsense and Parry Systems.
J. Philos. Log., 2015

Cut-Down Operations on Bilattices.
Proceedings of the 2015 IEEE International Symposium on Multiple-Valued Logic, 2015

2014
Extensions of Priest-da Costa Logic.
Stud Logica, 2014

On Non-Deterministic Quantification.
Logica Universalis, 2014

A computational interpretation of conceptivism.
J. Appl. Non Class. Logics, 2014

Lukasiewicz Negation and Many-Valued Extensions of Constructive Logics.
Proceedings of the IEEE 44th International Symposium on Multiple-Valued Logic, 2014

2012
Notes on the Model Theory of DeMorgan Logics.
Notre Dame J. Formal Log., 2012


  Loading...