
logic


I recently completed my PhD in mathematical logic, and I am trying to decide where to submit one of my main results. I would especially welcome answers from mathematicians who have experience as ...
_Journal of Philosophy_. forthcomingA well-known problem, due to Carnap, concerns how the meanings of logical connectives can possibly arise from the rules governing their use. Much less discussed is an analogous problem for quantifiers. This paper argues that the problem for quantifiers is serious, resists the usual solutions, and (on plausible semantic and metasemantic assumptions) forces us in…
I know this has been probably posted many times before but, I am a first year university student and want to learn more about philosophy especially metaphysics and Logic which interest me a-lot. I am ...
_Journal of Philosophical Logic_. 2026This paper draws attention to key logical relations between two distinct and independently intelligible notions, compatibility and implication. We identify a set of inference rules governing compatibility and show how crucial principles concerning conditionals can be derived from these rules, on the assumption that implication is definable in terms of compati…

Today I finally have the proof of the conjecture I have been working on this year. Unfortunately, it is not a coincidence that this is also the day ChatGPT-6 came out; my contribution barely went ...

There are a number of postulates that have been studied in constructive math that are anti-classical in the sense that they are demonstrably false in classical logic: for example, the postulate that ...
_Logique Et Analyse_ 32 (128):241-245. 1989In 1979 Meyer, Routley and Dunn found a new form of Russell's paradox, different from that found by Curry. By means of elementary syntactic transformations it is possible to clarify the relation which these paradoxes have with each other. Also, we will find new relationships with important metatheoric results relative to Peano's arithmetic (PA). We will …

Terence Tao notes AI can now rigorously check mathematical proofs up to 100,000 lines, raising questions about the future of mathematics and its goals.
This book presents a systematic development of Refined Quadruple Neutrosophic (T, I, N, F) Logic, extending classical neutrosophic logic by distinguishing Neutrality (N) from Pure Indeterminacy (I) and by refining each of the four components—Truth, Indeterminacy, Neutrality, and Falsehood—into semantically labeled subcomponents. The resulting n-valued structure provides a multidimensional represe…
Contents (This is a stub) Idea Subtractive logic is an extension of (propositional or first order) intuitionistic logic with a new connective, subtraction, dual to implication, such that each sentence have a “dual” verifying if and only if . Propositional subtractive logic is a conservative extension over propositional intuitionistic logic, but it is not the case for the first order case. Synt…
Are there semantically adequate languages that are authorities of their own truth but have no meta-language, so they are the sole authority of their own truth? A language on top of Tarski's infinite tower would be such a language. This can be proved by demonstration. We will now demonstrate it by building a rigorous paraconsistent model inside a non-well-founded set domain.
constructive mathematics, realizability, computability propositions as types, proofs as programs, computational trinitarianism topos, homotopy topos type theory, homotopy type theory canonical form, univalence Bishop set, h-set decidable equality, decidable subset, inhabited set, subsingleton A proof assistant or proof management system is a kind of software designed to help with proofs in formal…
constructive mathematics, realizability, computability propositions as types, proofs as programs, computational trinitarianism topos, homotopy topos type theory, homotopy type theory canonical form, univalence Bishop set, h-set decidable equality, decidable subset, inhabited set, subsingleton The arithmetical hierarchy or arithmetic hierarchy or Kleene–Mostowski hierarchy is a hierarchy used in c…
HIGHLIGHTS ▸ A theorem that identifies a pathology owes a test for identifying it. The Inversion Theorem states what inversion is: a disposition deprived of its substrate does not diminish but persists in form, occupied by the power that emptied it. It does not state how to determine, in a given case, whether inversion has occurred or whether something has merely worn out. Until it does, the theo…
mathematical logic deduction system, natural deduction, sequent calculus, lambda-calculus, judgment type theory, simple type theory, dependent type theory collection, object, type, term, set, element equality, judgmental equality, typal equality universe, size issues higher-order logic This page is to record the reference: William Lawvere, Robert Rosebrugh: Sets for Mathematics Cambridge Universi…
_Journal of Applied Logic – Ifcolog Journal_ 12 (2):189-220. 2025Building on McNamara’s DWE (Doing Well Enough) framework, a substantial generalization and refinement of that framework extends its expressive resources by adding two ordering operators, changing the underlying semantic ordering’s scope, and adding a number of other operators making fuller use of the resulting expanded frames. A sol…

The very architecture of our modern engagement with philosophy encourages logic-chopping and the straw-manning of positions, reducing philosophy to single arguments.
research.ioSign up to keep scrolling
Create your feed subscriptions, save articles, keep scrolling.

