On the public citation graph

Is there a genuine modal perspective on feature structures?

0 signed · 44 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/978-94-009-6259-0_1openalex-snapshot
Basic Modal Logic
inferredcites →https://doi.org/10.1007/978-94-015-8242-1_2openalex-snapshot
Modal Logic and Attribute Value Structures
inferredcites →https://doi.org/10.1007/978-94-015-8242-1_7openalex-snapshot
How Completeness and Correspondence Theory Got Married
inferredcites →https://doi.org/10.1007/bf00630516openalex-snapshot
The logic of unification in grammar
inferredcites →https://doi.org/10.1007/bf00868090openalex-snapshot
Coreference and bound anaphora: A restatement of the anaphora questions
inferredcites →https://doi.org/10.1007/bf01049475openalex-snapshot
Syntactic codes and grammar refinement
inferredcites →https://doi.org/10.1007/bf01050635openalex-snapshot
A modal perspective on the computational complexity of attribute value grammar
inferredcites →https://doi.org/10.1007/bf01051766openalex-snapshot
On the expressivity of feature logics with negation, functional uncertainty, and sort equations
inferredcites →https://doi.org/10.1007/bf01620760openalex-snapshot
On the lattice of extensions of the modal logics KAltn
inferredcites →https://doi.org/10.1016/0022-0000(82)90018-6openalex-snapshot
Deterministic propositional dynamic logic: Finite models, complexity, and completeness
inferredcites →https://doi.org/10.1016/b978-0-444-81693-1.50016-6openalex-snapshot
An Overview of Stratified Feature Grammar
inferredcites →https://doi.org/10.1016/s0049-237x(08)70723-7openalex-snapshot
Some Connections Between Elementary and Modal Logic
inferredcites →https://doi.org/10.1017/cbo9780511530098openalex-snapshot
The Logic of Typed Feature Structures
inferredcites →https://doi.org/10.1037/023768openalex-snapshot
The logic of unification
inferredcites →https://doi.org/10.1075/cilt.75.08steopenalex-snapshot
6. Generalized Phrase Structure Grammar
inferredcites →https://doi.org/10.1093/logcom/2.1.5openalex-snapshot
Using the Universal Modality: Gains and Questions
inferredcites →https://doi.org/10.1093/logcom/5.1.93openalex-snapshot
Highway to the Danger Zone
inferredcites →https://doi.org/10.1305/ndjfl/1093636763openalex-snapshot
Modal logics with functional alternative relations.
inferredcites →https://doi.org/10.1305/ndjfl/1093891703openalex-snapshot
Normal forms in modal logic.
inferredcites →https://doi.org/10.1387/asju.8211openalex-snapshot
Negation in syntax: on the nature of functional categories and projections
inferredcites →https://doi.org/10.1515/9783111682228openalex-snapshot
Connectedness and binary branching
inferredcites →https://doi.org/10.22028/d291-24990openalex-snapshot
On the expressivity of feature logics with negation, functional uncertainty, and sort equations
inferredcites →https://doi.org/10.2307/2185122openalex-snapshot
Generalized Phrase Structure Grammar.
inferredcites →https://doi.org/10.2307/2272340openalex-snapshot
Logics containing K4. Part I
inferredcites →https://doi.org/10.2307/2274318openalex-snapshot
Logics containing K4. Part II
inferredcites →https://doi.org/10.2307/2275372openalex-snapshot
Canonical formulas for K4. Part I: Basic results
inferredcites →https://doi.org/10.2307/2275473openalex-snapshot
An undecidable problem in correspondence theory
inferredcites →https://doi.org/10.2307/2275487openalex-snapshot
Properties of independently axiomatizable bimodal logics
inferredcites →https://doi.org/10.2307/416224openalex-snapshot
Indices and identity . By Robert Fiengo and Robert May. Cambridge, MA: MIT Press, 1994. Pp. 315.
inferredcites →https://doi.org/10.3115/976744.976748openalex-snapshot
Talking about trees
inferredcites →https://doi.org/10.3115/976744.976749openalex-snapshot
Decidability and undecidability in stand-alone feature logics
inferredcites →https://doi.org/10.3115/992507.992531openalex-snapshot
Computational linguistics in 1990
inferredcites →https://doi.org/10.7551/mitpress/9780262527347.003.0003openalex-snapshot
A Minimalist Program for Linguistic Theory

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-14322-9_7openalex-snapshot
Some Interdefinability Results for Syntactic Constraint Classes
inferred← citeshttps://doi.org/10.1007/bfb0052150openalex-snapshot
Inessential features
inferred← citeshttps://doi.org/10.1007/s10849-008-9061-xopenalex-snapshot
Polyadic Dynamic Logics for HPSG Parsing
inferred← citeshttps://doi.org/10.1016/b978-0-444-53726-3.00006-2openalex-snapshot
GB Theory
inferred← citeshttps://doi.org/10.1016/b978-044481714-3/50008-4openalex-snapshot
GB Theory
inferred← citeshttps://doi.org/10.1017/s0952675703004408openalex-snapshot
Model theory and the content of OT constraints
inferred← citeshttps://doi.org/10.1093/obo/9780199772810-0029openalex-snapshot
Mathematical Linguistics
inferred← citeshttps://doi.org/10.1515/9783110895667.555openalex-snapshot
Bibliography
inferred← citeshttps://doi.org/10.3115/1225797.1225805openalex-snapshot
Logical investigations on the adequacy of certain feature-based theories of natural language
inferred← citeshttps://doi.org/10.3166/jancl.20.423-435openalex-snapshot
Judgment and consequence relations
inferred← citeshttps://doi.org/10.33011/lilt.v7i.1267openalex-snapshot
Using hybrid logic for querying dependency treebanks
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.