„definability“

Suchergebnisse

1.000+ Treffer

• Definability of linear equation systems over groups and rings
  Dawar, Anuj ; Grädel, Erich ; Holm, Bjarki ; Kopczynski, Eryk ; Pakusa, Wied 2012 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Parameterized complexity of weighted team definability
  Kontinen, Juha ; Mahmood, Yasir ; Meier, Arne ; Vollmer, Heribert 2024 Gottfried Wilhelm Leibniz Universität Hannover
• One-way Definability of Sweeping Transducer
  Baschenis, Félix ; Gauwin, Olivier ; Muscholl, Anca ; Puppis, Gabriele 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Lindström quantifiers and leaf language definability
  Burtschick, Hans-Jörg ; Vollmer, Heribert 1995 Leiter der Fachbibliothek Informatik, Sekretariat FR 5-4
• Expressivity and definability in extended modal languages
  Heinle, Wolfgang 1995 Shaker
• Definability and model checking – the role of orders and compositionality
  Ganzow, Tobias 2012 Hochschulbibliothek der Rheinisch-Westfälischen Technischen Hochschule Aachen
• A structural approach to diophantine definability
  Prunescu, Mihai
• Choiceless Computation and Symmetry: Limitations of Definability
  Pago, Benedikt Thomas 2021 Universitätsbibliothek der RWTH Aachen
• Correction to: Deduction and definability in infinite statistical systems
  Feintzeig, Benjamin H.
• Addendum to “A definable nonstandard enlargement”
  Herzberg, Frederik
• Infinitary primitive positive definability over the real numbers with convex relations
  Meyer, Sebastian
• Every Countable Model of Arithmetic or Set Theory has a Pointwise-Definable End Extension
  Hamkins, Joel David
• (Global) Quantification & (Local) Definability – Some Comments on del Valle-Inclán’s Criticism of Bonnay and Westerståhl’s Solution to Carnap’s problem
  Speitel, Sebastian G. W.
• Choice functions and well-orderings over the infinite binary tree
  Carayol, Arnaud ; Löding, Christof ; Niwinski, Damian ; Walukiewicz, Igor
• Definability in affine logic
  Bagheri, Seyed-Mohammad
• Resynchronized Uniformization and Definability Problems for Rational Relations
  Löding, Christof ; Winter, Sarah 2023 Universitätsbibliothek der RWTH Aachen
• The Complexity of Reverse Engineering Problems for Conjunctive Queries
  Barceló, Pablo ; Romero, Miguel 2017 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• Definability Equals Recognizability for k-Outerplanar Graphs
  Jaffke, Lars ; Bodlaender, Hans L. 2015 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• CMSO-Transducing Tree-Like Graph Decompositions
  Campbell, Rutger ; Guillon, Bruno ; Kanté, Mamadou Moustapha ; Kim, Eun Jung ; Köhler, Noleen 2025 Schloss Dagstuhl – Leibniz-Zentrum für Informatik
• On First-Order Definability and Computability of Progression for Local-Effect Actions and Beyond
  Liu, Yongmei ; Lakemeyer, Gerhard