Switch to: References

Add citations

You must login to add citations.
  1. On Representations of Intended Structures in Foundational Theories.Neil Barton, Moritz Müller & Mihai Prunescu - 2022 - Journal of Philosophical Logic 51 (2):283-296.
    Often philosophers, logicians, and mathematicians employ a notion of intended structure when talking about a branch of mathematics. In addition, we know that there are foundational mathematical theories that can find representatives for the objects of informal mathematics. In this paper, we examine how faithfully foundational theories can represent intended structures, and show that this question is closely linked to the decidability of the theory of the intended structure. We argue that this sheds light on the trade-off between expressive power (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Algorithmic uses of the Feferman–Vaught Theorem.J. A. Makowsky - 2004 - Annals of Pure and Applied Logic 126 (1-3):159-213.
    The classical Feferman–Vaught Theorem for First Order Logic explains how to compute the truth value of a first order sentence in a generalized product of first order structures by reducing this computation to the computation of truth values of other first order sentences in the factors and evaluation of a monadic second order sentence in the index structure. This technique was later extended by Läuchli, Shelah and Gurevich to monadic second order logic. The technique has wide applications in decidability and (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • In memory of Andrzej Mostowski.Helena Rasiowa & Wiktor Marek - 1977 - Studia Logica 36 (1-2):1 - 8.
    Download  
     
    Export citation  
     
    Bookmark  
  • Feferman–Vaught Decompositions for Prefix Classes of First Order Logic.Abhisekh Sankaran - 2023 - Journal of Logic, Language and Information 32 (1):147-174.
    The Feferman–Vaught theorem provides a way of evaluating a first order sentence \(\varphi \) on a disjoint union of structures by producing a decomposition of \(\varphi \) into sentences which can be evaluated on the individual structures and the results of these evaluations combined using a propositional formula. This decomposition can in general be non-elementarily larger than \(\varphi \). We introduce a “tree” generalization of the prenex normal form (PNF) for first order sentences, and show that for an input sentence (...)
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • On elementary equivalence of real semigroups of preordered rings.F. Miraglia & Hugo Mariano - forthcoming - Logic Journal of the IGPL.
    Download  
     
    Export citation  
     
    Bookmark  
  • Dominoes and the complexity of subclasses of logical theories.Erich Grädel - 1989 - Annals of Pure and Applied Logic 43 (1):1-30.
    Download  
     
    Export citation  
     
    Bookmark   3 citations