import type { TCorePropositionalExpression, TCorePropositionalVariable } from "../../schemata/index.js";
import type { ExpressionManager } from "../expression-manager.js";
import type { TFormulaTreeVisitor } from "../interfaces/index.js";
import type { TPremiseReadContext } from "./read-context.js";
export declare function renderPremiseExpression<TExpr extends TCorePropositionalExpression, TVar extends TCorePropositionalVariable>(ctx: TPremiseReadContext<TExpr, TVar>, expressionId: string): string;
export declare function walkPremiseExpression<T, TExpr extends TCorePropositionalExpression, TVar extends TCorePropositionalVariable>(ctx: TPremiseReadContext<TExpr, TVar>, visitor: TFormulaTreeVisitor<T>, expressionId: string): T;
/**
 * Every operator other than `not` in the tree under `rootId`, in depth-first
 * order — the operators a reader can grant or reject.
 */
export declare function collectDecidableOperators<TExpr extends TCorePropositionalExpression>(expressions: ExpressionManager<TExpr>, rootId: string | undefined): TExpr[];
/**
 * Returns true iff `candidateId` is a descendant of `ancestorId` in
 * this premise's expression tree. Used by `reparentExpression` for
 * the S-4 no-cycles check.
 */
export declare function isDescendantOf<TExpr extends TCorePropositionalExpression>(expressions: ExpressionManager<TExpr>, candidateId: string, ancestorId: string): boolean;
export declare function collectSubtree<TExpr extends TCorePropositionalExpression>(expressions: ExpressionManager<TExpr>, rootId: string): TExpr[];
//# sourceMappingURL=formula-tree.d.ts.map