Skip to content
<title>Channels - Goedel Logics: On the Elimination of The Absoluteness Operator :: FRELIP Discovery
Home
Search
Guides
Journals
Learning
FRELIP Discovery Search
Open Access Catalog for African Scholarship
Channels
Goedel Logics: On the Elimination of The Absoluteness Operator
Search for more channels:
Similar Items: Goedel Logics: On the Elimination of The Absoluteness Operator
Channel Options
View Record
Explore related channels
Quick Look
Pseudo-Complex Quantifier Elimination
Quick Look
Set-like operations on propositional logic programs
Quick Look
A Logic of Inability
Quick Look
Logics for Context-free Hyperproperties
Quick Look
Neural networks as fuzzy logic formulas
Quick Look
A Fibrational Perspective on Differential Linear Logic
Quick Look
Quantum Bayesian Networks: Compositionality and Typing via Linear Logic
Quick Look
Value Functions for Temporal Logic: Optimal Policies and Safety Filters
Quick Look
Cross-Attention and Encoder-Decoder Transformers: A Logical Characterization
Quick Look
Automaton-based Characterisations of First Order Logic over Infinite Trees
Quick Look
Beyond Ability: The Four-Fold Spectrum of Power and the Logic of Full Inability
Quick Look
Order-invariant cluster first-order logic on graph classes of bounded degree
Quick Look
On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
Quick Look
Tree transducers of linear size-to-height increase (and the additive conjunction of linear logic)
Quick Look
Decidability Results for Fragments of First-Order Logic via a Symbolic Model Property
Quick Look
A Fast Model Counting Algorithm for Two-Variable Logic with Counting and Modulo Counting Quantifiers
Quick Look
Paraconsistent Semantics for Extended Fuzzy Logic Programs via Approximation Fixpoint Theory [Extended Version]
Quick Look
Verification of Neural Networks (Lecture Notes)
Quick Look
Templates in Rewriting Induction
Quick Look
Compressing ACAS-Xu Lookup Tables with Binary Decision Diagrams
Quick Look
Grounding vs. Compositionality: On the Non-Complementarity of Reasoning in Neuro-Symbolic Systems
Quick Look
On-the-fly LTLf Synthesis under Partial Observability
Quick Look
Finite-Horizon First-Order Rank Profiles of Regular Languages
Quick Look
Runtime Verification: Monitoring, Knowledge, and Uncertainty (Lecture Notes)
Load more items
View Record
Prev
Explore related channels
Next
