This is my master thesis project, supervised by Prof. Dr. Jan Niehues and Prof. Dr. Gregor Betz, both from the Karlsruhe Institute of Technology. It is about teaching different large language models ...
In predicate logic, the conditional operator (→) represents an implication. For two predicates, P (X) and Q (X), P (X) → Q (X) signifies that all elements in the truth set of P (X) are also elements ...
A new formalism for predicate logic is introduced, with a non-standard method of binding variables, which allows a compositional formalization of certain anaphoric constructions, including 'donkey ...
Historically, it was initially a formalization of mathematical language and reasoning, proposed by G. Frege between the end of the 19th and the beginning of the 20th century, and "popularized" by B.
Abstract: This article deals with some probabilistic model theory for intuitionistic predicate logic. We introduce the notions of intuitionistic probability, probabilistic structure for intuitionistic ...
We say that an n-argument predicate $P\subset \Omega ^{n}$ is finite, if P is a finite set. Note that the set of individuals Ω is infinite! Finite predicates are ...
Abstract: We study predicate logic that is interpreted in Kripke models similarly to intuitionistic logic except that the accessibility relation of each model is not necessarily reflexive. Unlike in ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback