Kernels, truth and satisfaction

DOI10.4064/BA8176-1-2019MaRDI QIDQ5382835zbMATH OpenOpenAlexWikidataFDO

Authors James H. Schmerl

Publication date 18 June 2019

Published in Bulletin Polish Acad. Sci. Math. (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1807.11832

zbMATH Keywords

directed graphskernelsnon-standard modelsPeano arithmeticsatisfaction classes

Mathematics Subject Classification ID

Models with special properties (saturated, rigid, etc.) (03C50) Nonstandard models of arithmetic (03H15) Directed graphs (digraphs), tournaments (05C20)

Abstract: The notions of the kernel of a graph, full truth sets and full satisfaction sets are connected.

Recommendations

• On kernels, defaults and even graphs
• Experimental investigation of sufficient criteria for relations to have kernels
• scientific article; zbMATH DE number 1332100
• Kernels and Choquet capacities
• scientific article; zbMATH DE number 1488480
• On the uniqueness of kernels
• Finding kernels or solving SAT
• Rational kernels: theory and algorithms
• scientific article; zbMATH DE number 2070068
• Theory of Reproducing Kernels

Cites work

• An introduction to recursively saturated and resplendent models
• Construction of Satisfaction Classes for Nonstandard Models
• Digraphs
• scientific article; zbMATH DE number 3106184 (Why is no real title available?)

Cited in

(3)

• Full satisfaction classes, definability, and automorphisms
• Logic Programming
• Deflationary truth and pathologies

This page was built for publication: Kernels, truth and satisfaction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5382835)