Relevant bibliographies by topics / Łoś-Tarski-Theorem

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Łoś-Tarski-Theorem'

Author: Grafiati
Published: 4 June 2021
Last updated: 18 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Łoś-Tarski-Theorem.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Łoś-Tarski-Theorem"

1

Sankaran, Abhisekh, Bharat Adsul, and Supratik Chakraborty. "A generalization of the Łoś–Tarski preservation theorem." Annals of Pure and Applied Logic 167, no. 3 (2016): 189–210. http://dx.doi.org/10.1016/j.apal.2015.11.001.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Motohashi, Nobuyoshi. "Preservation theorem and relativization theorem for cofinal extensions." Journal of Symbolic Logic 51, no. 4 (1986): 1022–28. http://dx.doi.org/10.2307/2273913.

Full text
Abstract:
One of the typical preservation theorems in a first order classical predicate logic with equality L is the following theorem due to J. Łoś [4] and A. Tarski [9] (also cf. [1, p. 139]).Theorem A (Łoś-Tarski). For any sentences A and B in L, the following two conditions (i) and (ii) are equivalent.(i) Every extension of any model of A is a model of B.(ii) The two sentences A ⊃ C and C ⊃ B are provable in L for some existential sentence C in L.In [2], S. Feferman obtained a similar preservation theorem for outer extensions. In the following, we assume that L has a fixed binary predicate symbol &l
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Łoś-Tarski-Theorem"

1

Heimberg, Lucas. "Complexity of Normal Forms on Structures of Bounded Degree." Doctoral thesis, Humboldt-Universität zu Berlin, 2018. http://dx.doi.org/10.18452/19205.

Full text
Abstract:
Normalformen drücken semantische Eigenschaften einer Logik durch syntaktische Restriktionen aus. Sie ermöglichen es Algorithmen, Grenzen der Ausdrucksstärke einer Logik auszunutzen. Ein Beispiel ist die Lokalität der Logik erster Stufe (FO), die impliziert, dass Graph-Eigenschaften wie Erreichbarkeit oder Zusammenhang nicht FO-definierbar sind. Gaifman-Normalformen drücken die Bedeutung einer FO-Formel als Boolesche Kombination lokaler Eigenschaften aus. Sie haben eine wichtige Rolle in Model-Checking Algorithmen für Klassen dünn besetzter Graphen, deren Laufzeit durch die Größe der auszuwert
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Łoś-Tarski-Theorem"

1

Sankaran, Abhisekh. "Revisiting the Generalized Łoś-Tarski Theorem." In Logic and Its Applications. Springer Berlin Heidelberg, 2019. http://dx.doi.org/10.1007/978-3-662-58771-3_8.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sankaran, Abhisekh, Bharat Adsul, and Supratik Chakraborty. "A Generalization of the Łoś-Tarski Preservation Theorem over Classes of Finite Structures." In Mathematical Foundations of Computer Science 2014. Springer Berlin Heidelberg, 2014. http://dx.doi.org/10.1007/978-3-662-44522-8_40.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Łoś-Tarski-Theorem"

1

Chen, Yijia, and Jorg Flum. "Forbidden Induced Subgraphs and the Łoś–Tarski Theorem." In 2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS). IEEE, 2021. http://dx.doi.org/10.1109/lics52264.2021.9470742.

Full text
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography