On the public citation graph

Herbrand's Theorem, Skolemization and Proof Systems for First-Order Lukasiewicz Logic

0 signed · 43 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-44622-2_12openalex-snapshot
Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic
inferredcites →https://doi.org/10.1007/3-540-45653-8_14openalex-snapshot
Herbrand’s Theorem for Prenex Gödel Logic and Its Consequences for Theorem Proving
inferredcites →https://doi.org/10.1007/978-3-540-45206-5_6openalex-snapshot
Bounded Łukasiewicz Logics
inferredcites →https://doi.org/10.1007/978-3-540-69407-6_3openalex-snapshot
Herbrand Theorems and Skolemization for Prenex Fuzzy Logics
inferredcites →https://doi.org/10.1007/978-3-540-72734-7_10openalex-snapshot
Density Elimination and Rational Completeness for First-Order Logics
inferredcites →https://doi.org/10.1007/978-3-540-73099-6_5openalex-snapshot
Proof Theory for First Order Łukasiewicz Logic
inferredcites →https://doi.org/10.1007/978-94-011-5300-3openalex-snapshot
Metamathematics of Fuzzy Logic
inferredcites →https://doi.org/10.1016/0022-1236(86)90015-7openalex-snapshot
Interpretation of AF C∗-algebras in Łukasiewicz sentential calculus
inferredcites →https://doi.org/10.1016/0165-0114(94)00172-4openalex-snapshot
On triangular norm-based propositional fuzzy logics
inferredcites →https://doi.org/10.1016/0304-3975(87)90083-1openalex-snapshot
Satisfiability in many-valued sentential logic is NP-complete
inferredcites →https://doi.org/10.1016/j.fss.2005.03.005openalex-snapshot
Making fuzzy description logic more general
inferredcites →https://doi.org/10.1016/j.tcs.2008.05.019openalex-snapshot
Density elimination
inferredcites →https://doi.org/10.1016/s0049-237x(09)70277-0openalex-snapshot
Axiomatizability of some many valued predicate calculi
inferredcites →https://doi.org/10.1016/s0165-0114(01)00106-3openalex-snapshot
Fuzzy logic programming
inferredcites →https://doi.org/10.1017/cbo9780511735219.011openalex-snapshot
Model theory for metric structures
inferredcites →https://doi.org/10.1145/1071596.1071600openalex-snapshot
Sequent and hypersequent calculi for abelian and łukasiewicz logics
inferredcites →https://doi.org/10.1613/jair.813openalex-snapshot
Reasoning within Fuzzy Description Logics
inferredcites →https://doi.org/10.2178/jsl/1191333844openalex-snapshot
Substructural fuzzy logics
inferredcites →https://doi.org/10.2307/2268660openalex-snapshot
A theorem about infinite-valued sentential logic
inferredcites →https://doi.org/10.2307/2270410openalex-snapshot
Further results on infinite valued predicate logic
inferredcites →https://doi.org/10.2307/2271335openalex-snapshot
A weak completeness theorem for infinite valued first-order logic
inferredcites →https://doi.org/10.2307/2271339openalex-snapshot
Axiomatization of the infinite-valued predicate calculus
inferredcites →https://doi.org/10.2307/2273828openalex-snapshot
A constructive analysis of RM
inferredcites →https://doi.org/10.2307/2964111openalex-snapshot
Die nichtaxiomatisierbarkeit des unendlichwertigen Prädikatenkalküls von Łukasiewicz
inferredcites →https://doi.org/10.3233/fun-2004-59401openalex-snapshot
Analytic Calculi for Monoidal T-norm Based Logic
inferredcites →https://doi.org/10.3929/ethz-a-000226207openalex-snapshot
Arithmetische Klassifikation von Formelmengen der unendlichwertigen Logik
inferredcites →https://doi.org/10.4064/fm-50-2-165-190openalex-snapshot
Axiomatizability of some many valued predicate calculi

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/978-3-642-45221-5_39openalex-snapshot
Herbrand Theorems for Substructural Logics
inferred← citeshttps://doi.org/10.1007/978-94-007-0840-2_19openalex-snapshot
A First-Order Łukasiewicz Logic with [0, 1]-Identity
inferred← citeshttps://doi.org/10.1007/s10469-016-9382-9openalex-snapshot
Free-Variable Semantic Tableaux for the Logic of Fuzzy Inequalities
inferred← citeshttps://doi.org/10.1007/s11225-009-9185-2openalex-snapshot
Giles’s Game and the Proof Theory of Łukasiewicz Logic
inferred← citeshttps://doi.org/10.1016/j.apal.2010.09.005openalex-snapshot
The eskolemization of universal quantifiers
inferred← citeshttps://doi.org/10.1016/j.fss.2009.09.006openalex-snapshot
Triangular norm based predicate fuzzy logics
inferred← citeshttps://doi.org/10.1016/j.indag.2019.01.002openalex-snapshot
The Skolemization of prenex formulas in intermediate logics
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.007openalex-snapshot
Skolemization and Herbrand theorems for lattice-valued logics
inferred← citeshttps://doi.org/10.1093/jigpal/jzw010openalex-snapshot
Skolemization in intermediate logics with the finite model property
inferred← citeshttps://doi.org/10.1093/logcom/ext018openalex-snapshot
Proof theory of witnessed Gödel logic: A negative result
inferred← citeshttps://doi.org/10.12775/llp.2022.030openalex-snapshot
Comparing Calculi for First-Order Infinite-Valued Łukasiewicz Logic and First-Order Rational Pavelka Logic
inferred← citeshttps://doi.org/10.23638/lmcs-14(1:10)2018openalex-snapshot
A Real-Valued Modal Logic
inferred← citeshttps://doi.org/10.3103/s1055134418020013openalex-snapshot
Infinite-Valued First-Order Łukasiewicz Logic: Hypersequent Calculi Without Structural Rules and Proof Search for Sentences in the Prenex Form
inferred← citeshttps://doi.org/10.33048/semi.2020.17.127openalex-snapshot
Repetition-free and infinitary analytic calculi for first-order rational Pavelka logic
inferred← citeshttps://doi.org/10.4213/sm10274openalex-snapshot
Депренексификация в аналитических исчислениях для первопорядковой рациональной логики Павелки
inferred← citeshttps://doi.org/10.4213/sm10274eopenalex-snapshot
Deprenexification in analytic calculi for first-order rational Pavelka logic
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.