Switch to: References

Add citations

You must login to add citations.
  1. Completeness and interpolation of almost‐everywhere quantification over finitely additive measures.João Rasga, Wafik Boulos Lotfallah & Cristina Sernadas - 2013 - Mathematical Logic Quarterly 59 (4-5):286-302.
    We give an axiomatization of first‐order logic enriched with the almost‐everywhere quantifier over finitely additive measures. Using an adapted version of the consistency property adequate for dealing with this generalized quantifier, we show that such a logic is both strongly complete and enjoys Craig interpolation, relying on a (countable) model existence theorem. We also discuss possible extensions of these results to the almost‐everywhere quantifier over countably additive measures.
    Download  
     
    Export citation  
     
    Bookmark  
  • On Compactness of Logics That Can Express Properties of Symmetry or Connectivity.Vera Koponen & Tapani Hyttinen - 2015 - Studia Logica 103 (1):1-20.
    A condition, in two variants, is given such that if a property P satisfies this condition, then every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The result is used to prove that for a number of natural properties P speaking about automorphism groups or connectivity, every logic which is at least as strong as first-order logic and can express P fails to have the compactness property. The basic (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Strong downward Löwenheim–Skolem theorems for stationary logics, I.Sakaé Fuchino, André Ottenbreit Maschio Rodrigues & Hiroshi Sakai - 2020 - Archive for Mathematical Logic 60 (1-2):17-47.
    This note concerns the model theoretic properties of logics extending the first-order logic with monadic second-order variables equipped with the stationarity quantifier. The eight variations of the strong downward Löwenheim–Skolem Theorem down to <ℵ2\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$<\aleph _2$$\end{document} for this logic with the interpretation of second-order variables as countable subsets of the structures are classified into four principles. The strongest of these four is shown to be equivalent to the conjunction of CH and the (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Counting Incompossibles.Peter Fritz & Jeremy Goodman - 2017 - Mind 126 (504):1063–1108.
    We often speak as if there are merely possible people—for example, when we make such claims as that most possible people are never going to be born. Yet most metaphysicians deny that anything is both possibly a person and never born. Since our unreflective talk of merely possible people serves to draw non-trivial distinctions, these metaphysicians owe us some paraphrase by which we can draw those distinctions without committing ourselves to there being merely possible people. We show that such paraphrases (...)
    Download  
     
    Export citation  
     
    Bookmark   34 citations